说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 谱相同的图
1)  Cospectral graphs
谱相同的图
2)  cospectral graph
同谱图
1.
But, a pair of cospectral graphs were found out by Collatz and Sinogowitz a year later.
但是,一年以后,Collatz和Sinogowitz找到了一对同谱图。
2.
In this thesis,we consider the extremal graphs about Laplacian spectral radius of bipartite graphs with k cut edges,bicyclic bipartite graphs,unicyclic graphs with fixed diameters,unicyclic graphs with k pendent edges;some graphs determined by their spectra;cospectral graphs;minimal distance spectral radius.
本论文主要研究了有k条割边的二部图,双圈二部图,有固定直径的单圈图以及有k条悬挂边的单圈图关于Laplace谱半径的极值图:由谱决定的一些图;同谱图;最小距离谱半径。
3)  cospectral graphs
同谱图
1.
Using the property of cospectral graphs and the relation between eigenvalue and the degree of vertices, it is proven that the double-starlike tree Dn,p,p-7 (p>13) is determined by its Laplacian spectrum by reduction to absurdity and comparing the largest eigenvalues of two graphs.
利用同谱图的性质及图的特征值与图的顶点的度之间的关系,通过比较图的最大特征值的大小和反证法,证明了似双星树Dn,p,p-7(p>13)由它的Laplacian谱确定。
2.
By using the properties of cospectral graphs,it is proved that some trees with special structure,such as comb,a kind of molecular graph of alkyl,trees with exactly two eigenvalue greater than 2(include double-star),et,are determined by their Laplacian spectra,respectively.
利用同谱图的线图的特点,证明了一些特殊结构的树,如梳图,烷的一个同分异构体的分子图,恰有两个Laplacian特征值大于2的树(包括双星图)等,各自由它们的Laplacian谱确定。
3.
In this paper,by using the properties of cospectral graphs,it is proved that the F-shape tree is uniquely determined by its Laplacian spectra.
本文利用同谱图的线图的特点,证明了F型树可由它的Laplacian谱确定。
4)  Metallograph [英][mi'tæləgrɑ:f]  [美][mə'tælə,græf]
金相图谱
1.
The Database and Analyzing System on the Metallograph;
金相图谱数据库与分析系统
5)  Isoenzymes pattern
同功酶图谱
6)  Isopectral molecules
同谱异构图
1.
Isopectral molecules refers to the different graphs those have the same characteristic polynomials.
同谱异构图是指图的邻接矩阵的特征多项式相同但图形结构不同的图形。
补充资料:图的减缩图(或称图子式)


图的减缩图(或称图子式)
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
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条