位置：成果数据库 > 期刊 > 期刊详情页
Halin图谱半径的新上界及极图
  • 期刊名称：高校应用数学学报A辑
  • 时间：0
  • 页码：335-342
  • 语言：中文
  • 分类：O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]杭州外国语学校, [2]华东师范大学计算机理论研究所
  • 相关基金：国家自然科学基金(10671074；60673048);; 国家重点基础研究发展计划(‘973’，2006CB805901);; 上海市重点学科建设项目(B407)
  • 相关项目：图谱理论及其相关问题
作者： 束金龙|袁劲松|
关键词： HALIN图, 谱半径, 邻接矩阵, Halin graph, spectral radius, adjacency matrix
中文摘要：

利用移接变形的方法再结合特征值的计算技巧刻画出Halin图中谱半径达到第二大的极图,从而得到除轮图以外的Halin图的谱半径的上界以及极图.

英文摘要：

An upper bound for the spectral radius of Halin graphs and extremal graphs except wheel graphs is obtained by using the theory of nonnegative matrices and the"moving edge"technique.

同期刊论文项目
图谱理论及其相关问题
期刊论文 39
图的标号问题与子图存在性的理论和算法研究
期刊论文 44
同项目期刊论文
On the Laplacian Spectral Radius of Graphs
The spread of the unicyclic graphs
note Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
The Laplacian spectral radius of bicyclic graphs with given girth
一类新变换图的基本性质
图的零度综述
关于最大度确定的树的谱半径
On the spectral radius of bipartite graphs with given diameter
不含3-圈和4-圈的平面图的列表均匀染色
色数与谱半径和生成偶子图(英文)
连通图的排序
Sharp bounds for the spectral radius of digraphs
Normal forms for orthogonal similarity classes of matrices
Forest growth modelling by using matrix theory
图的Q-谱谱半径的可达界
CS-阵的组合刻划
Stability of Invariant Subspaces of Real Tri-diagonal Matrices
树的Nordhaus-Gaddum类型谱半径的排序
具有k条割边的极图
A sufficient condition for cyclability in directed graphs
图的移接变换与谱半径大小的关系
(k, m)-Catalan numbers and hook length polynomials for plane trees
The DLT Algorithm and Its Improvement
Complete Positivity of Affinity Matrices
具有次大和第三大谱半径的n阶2-树(英文)
变换图的正则性和谱半径
具有次大和第三大谱半径的n阶2-树
具有特殊工件的平行机在线排序问题
树的Nordhaus—Gaddum类型谱半径的排序
树的变形与代数连通度
Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter
图的L(3,2,1)-标号
图和有向图的测地数
有向图的L(j,k)数的上界(英文)
An extremal problem on non-full colorable graphs
Extremal problems on consecutive L(2,1)-labelling
The geodetic numbers of graphs and digraphs
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Distance paired-domination problems on subclasses of chordal graphs
The least eigenvalue of unicyclic graphs with n vertices and k pendant vertices
Maximizing the spectral radius of bicyclic graphs with fixed girth
The minimum spectral radius of graphs with a given independence number
Maximizing the Laplacian spectral radii of graphs with given diameter
The minimal Laplacian spectral radius of trees with a given diameter
一类新变换图的基本性质
图的零度综述
Distance-two labellings of Hamming graphs
The Upper and Lower Geodetic Numbers of Graphs
求图中顶点之间所有最短路径的一种算法
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
关于最大度确定的树的谱半径
双圈连通图的L(2，1)-labelling(英文)
度为奇数的正则图的上负全控制数
Constructive characterizations of (gamma(p), gamma)- and (gamma(p), gamma(pr))-trees
求图中受顶点数限制的所有最短路径的算法
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
具有k条割边的极图
变换图的正则性和谱半径
具有次大和第三大谱半径的n阶2-树
具有特殊工件的平行机在线排序问题
树的Nordhaus—Gaddum类型谱半径的排序
Constructive characterizations of （γp, γ）- and （γp, γpr）-trees
有向图的L（j,k）数的上界
双圈连通图的L（2，1）-labelling
ON THE NUMBER OF INCREASING PATHS IN LABELED CYCLES AND STARS
Sharp Lower Bound of the Least Eigenvalue of Graphs with Given Diameter
The L（3,2, 1）-labeling on Bipartite Graphs
一类连通可满着色图的L（2,1）标号