期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Maximizing Spectral Radius of Trees with Given Maximal Degree 被引量:1
1
作者 FAN Yi Zheng ZHU Min 《Journal of Mathematical Research and Exposition》 CSCD 2009年第5期806-812,共7页
In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.
关键词 trees maximal degree Laplacian eigenvalue adjacency eigenvalue spectral radius.
下载PDF
Regular and Maximal Graphs with Prescribed Tripartite Graph as a Star Complement
2
作者 Xiaona FANG Lihua YOU 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2023年第4期517-532,共16页
Let G be a graph of order n andμbe an adjacency eigenvalue of G with multiplicity k≥1.A star complement H forμin G is an induced subgraph of G of order n-k with no eigenvalueμ,and the subset X=V(G-H)is called a st... Let G be a graph of order n andμbe an adjacency eigenvalue of G with multiplicity k≥1.A star complement H forμin G is an induced subgraph of G of order n-k with no eigenvalueμ,and the subset X=V(G-H)is called a star set forμin G.The star complement provides a strong link between graph structure and linear algebra.In this paper,the authors characterize the regular graphs with K2,2,s(s≥2)as a star complement for all possible eigenvalues,the maximal graphs with K2,2,s as a star complement for the eigenvalueμ=1,and propose some questions for further research. 展开更多
关键词 adjacency eigenvalue Star set Star complement Regular graph Maximal graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部