位置：成果数据库 > 期刊 > 期刊详情页
A FACTOR OF NON-DS GRAPHS
  • 期刊名称：Advances and applications in Discrete Mathematics
  • 时间：0
  • 页码：133-138
  • 语言：英文
  • 相关项目：图的多项式研究及应用
作者： Tingzeng WU,Haicheng MA|
同期刊论文项目
图的多项式研究及应用
期刊论文 53
同项目期刊论文
The vulnerability of complete k-ary trees
On the spectral characterization of the union of complete multipartite graph and some isolated verti
具有2图的刻画
一类Caterpillars图的匹配刻画
K_1∪T(1,3,n)及其补图的匹配刻画
点圈并图的匹配等价图数
The minimum number of polychromatic C-hyperedges of the complete uniform mixed hypergraphs under one
On the number of closed 6-walks
非正则图的最大特征值
A SHARP LOWER BOUND OF THE SPECTRAL RADIUS OF SIMPLE GRAPHS
表格式分部和分及应用
S~(GS*)类图簇的伴随多项式的因式分解及其色性
单圈图的最大特征值的上界的改进(英文)
On the spectral radius of bistarlike tree
Graph Description by the Chromatic Polynomials
几类图的零度
满足某些不等式条件的置换与二分图
单圈图毁度的一个算法
A Note on the Nullity of Unicyclic Graphs
On the Nullity Algorithm of Tree and Unicyclic Graph
Spectral Characterization of the Edge-Deleted Subgraphs of Complete Graph
H~(s(i,j))型图的伴随分解及其补图的色等价性
Non-regular graphs with the same determinant as a complete graph
Two Families of Spanning Subgraphs of a Complete Graph are Determined by Their Spectrum
The Vulnerability of Cartesian Products of Graphs
Two classes unicyclic graphs are determined by their Laplacian spectrum
KUH(3,m,3)的匹配刻画
眼镜图的谱刻图
m重似星树的谱半径(英文)
同谱图的构造
完全k叉树的离散数和完整度
C-完全一致混合超图不可着色的充要条件
D-完全一致混合超图不可着色的一个充要条件
GSPj1型图簇的伴随分解及其补图的色等价性
图的邻接矩阵的行列式与积和式的递推表达式
No H-shape trees are cospectral
完全图删边子图的匹配唯一性
A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE
m·K_1∪T(1,2,n)及其补图的匹配刻画
图的多项式与Hosoya指标
H^s（i,j）型图的伴随分解及其补图的色等价性
GS^Pj1型图簇的伴随分解及其补图的色等价性
S^GS＊类图簇的伴随多项式的因式分解及其色性
形图簇的伴随分解及其补图的色等价性
完全图的两类生成子图是谱唯一确定的
Improved Upper Bounds for the Largest Eigenvalue of Unicyclic Graphs
图簇h（P_m（r,n＋1）^SG ）的伴随多项式的因式分解及其补图的色等价性
K_1∪T（1,3,n）及其补图的匹配刻画
Spectral Characterization of the Edge-Deleted Subgraphs of Complete Graph
m重似星树的谱半径
卡氏积图的抗毁性