1) multiwheelgraph
多轮图
1.
In this paper, expressions (explicit expression and recursion expression) of spanning tree numbers of wheelgraph and multiwheelgraph are obtained through calculating spanning tree numbers with digraph method, calculating block matrix determinant and solving constant coefficient linear recurring equation.
本文应用计算生成树个数的有向图方法、分块矩阵的行列式计算法以及常系数线性递归方程的解法 ,计算得到轮图和多轮图的生成树个数的表达式 (显式或递推式
2) polysome profile
多核糖体轮廓图
3) wheel
[英][wi:l] [美][wil]
轮图
1.
obtain a lower bound of γ~′_(st)(G) for all k-regular graphs of order n,and determine the exact value of γ~′_(st)(W_(n+1)) of for all wheels W_(n+1) ,In addition,we pose a conjecture about the upper bound of γ~′_(st)(G).
引入了图的符号边全控制的概念,主要刻划了满足sγt′(G)=|E(G)|且δ(G)2的所有连通图G,给出了n阶k-正则图G的符号边全控制数γst′(G)的下限,确定所有轮图的符号边全控制数,最后还提出了一个关于sγ′t(G)上界的猜想。
2.
In this paper we determine the signed star domination numbers of all wheels and complete bipartite graphs.
本文确定了所有的轮图和完全二部图的符号星控制数。
3.
In this paper we give the signed edge domination num bers for all wheels.
给出了所有轮图的符号边控制
4) wheel graph
轮图
1.
This paper gives the definition of edge list coloring and vertex list coloring and verter edeg list coloring,if G is wheel graph,then xLE(G)=△(G),xLE(G)=4,xLVE(G)=△(G)+1.
文章给出了边列表染色和顶点列表染色的定义,证明了对轮图,边选择数χLE(G)=△(G),点选择数χLE(G)=4,点边选择数χLE(G)=△(G)+1。
2.
The(d,1)-total labelling numbers of the fan and wheel graphs were presented.
得到了扇图与轮图的(d,1)-全标号数。
3.
The explicit expressions of the Smith normal form of sandpile group on the modified wheel graphs are given.
确定了修改轮图的临界群的结构,给出了它们的临界群的Smith标准形的精确形式,证明了它们的临界群总是循环群或两个循环群的直和。
5) wheels
[英][hwi:lz] [美][hwilz]
轮图
1.
In addition,we determine the signed tree domination numbers for some special classes of graphs G,including cycles,wheels,complete graphs and complete bipartite graphs.
引入了图的符号树控制的概念,给出一个连通图G的符号树控制数γ′T(G)的一个上界和一个下界,说明了这两个界限均是最好可能的,并确定几类特殊图的符号树控制数,这包括了圈、轮图、完全图和完全二部图。
2.
In this paper,we give a improved low bound of the signed k-subdomination number of a graph G,finally the signed k-subdomination numbers of wheels are determined.
给出了图的符号k-控制数的下界的一个改进的结论,并确定了轮图的符号k-控制数。
3.
In particular, the chromatic polynomials of complements of all wheels with any missing consecutive spokes are given.
特别的,对轮图中去掉一些连续弦后所得到的图的补图,给出了它的色多项式的计算公式。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条