位置：成果数据库 > 期刊 > 期刊详情页
双圈图按谱半径的排序
  • 期刊名称：数学学报，53（3），2010,469-476
  • 时间：0
  • 分类：O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]中国石油大学数学学院,东营257061
  • 相关基金：国家自然科学基金资助项目（10871204）
  • 相关项目：图的拉普拉斯谱
关键词： 双圈图, 谱半径, 特征多项式, bicyclic graph, spectral radius, characteristic polynomial
中文摘要：

一个n阶简单连通图G被称为双圈图,如果它的边数是n＋1.记B（n）是n阶双圈图的全体.本文确定了B（n）（n≥20）中谱半径的第六大至第十大值和对应的图.

英文摘要：

A simply connected graph G of order n is called a bicyclic graph if the number of edges of G is n＋1.Let B（n） be the set of all bicyclic graphs with n vertices. This paper determines the sixth to tenth largest value of spectral radii together with the corresponding graphs in B（n）（n≥20）.

同期刊论文项目
图的拉普拉斯谱
期刊论文 19
同项目期刊论文
On the spectral radius of weighted trees with fixed diameter and weight set
On the weighted trees with given degree sequence and positive weight set
The algebraic connectivity of graphs under perturbation
On the Laplacian spectral radius of weighted trees with a positive weight set
The smallest values of algebraic connectivity for unicyclic graphs
On the Laplacian coefficients of unicyclic graphs with prescribed matching number
给定阶和边独立数的单圈图的谱半径
On the nullity and the matching number of unicyclic graphs
The Laplacian spectral radii of unicyclic and bicyclic graphs with n vertices and k pendant vertices
On the Distribution of Laplacian Eigenvalues of a Graph
The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity
给定直径和悬挂点数的树的拉普拉斯系数
关于树的第二个最大特征值
使图的谱半径增大的边移动新方法
On the Laplacian Spectral Radius of Trees
具有固定围长的单圈图的无号拉普拉斯谱半径
On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph
Ordering Trees with Fixed Order and Matching Number by Laplacian Spectral Radius