位置：成果数据库 > 期刊 > 期刊详情页
TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS
  • ISSN号：1793-8309
  • 期刊名称：Discrete Mathematics, Algorithms and Applications
  • 时间：0
  • 页码：185-191
  • 相关项目：图和复杂网络的谱分析
作者： YA-HONG CHEN|RONG-YING PAN|Xiao-Dong Zhang|
同期刊论文项目
图和复杂网络的谱分析
期刊论文 28
同项目期刊论文
The first Dirichlet eigenvalue of bicyclic graphs
图与复杂网络的拉普拉斯谱(英文)
The Wiener Index of Unicyclic Graphs with Girth and Matching Number
Nodal domain partition and the number of communities in networks
数的变形与代数连通度
给定最大度的树的代数连通度(英文)
Automorphism group of the derangement graph
A NEW ENTANGLEMENT MEASURE: D-CONCURRENCE
Maximum Wiener Index of Trees with Given Degree Sequence
基于SNS社交网络的增长模型
Double quasi-star tree is determined by its Laplacian spectrum
Consensus and synchronization problems on small-world networks
THE P-LAPLACIAN SPECTRAL RADIUS OF WEIGHTED TREES WITH A DEGREE SEQUENCE AND A WEIGHT SET
Vertex Degrees and Doubly Stochastic Graph Matrices
Potential distribution on random electrical networks
偶错位图的张量幂的最大独立集和自同构群
A Note on Eigenvalues of the Derangement Graph
The Clustering Coefficient and the diameter of small-world networks
Trees with the most subtrees – an algorithmic approach
Faber-Krahn type inequality for unicyclic graphs
Automorphism groups of the Pancake graphs
Fast Reciprocal Jacket Transform With Many Parameters
Kotzig frames and circuit double covers
给定最大度的树的代数连通度
时间敏感的社交网络热点话题检测