Maximizing the Index of Trees with Given Domination Number

被引：1

作者：

Guo, Guangquan ^{[1
]}

Wang, Guoping ^{[1
]}

机构：

[1] Xinjiang Normal Univ, Sch Math Sci, Urumqi 830054, Xinjiang, Peoples R China

来源：

CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES | 2014年 / 57卷 / 03期

关键词：

trees; spectral radius; index; domination number; SPECTRAL-RADIUS; VERTICES; DIAMETER;

D O I：

10.4153/CMB-2014-023-5

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The index of a graph G is the maximum eigenvalue of its adjacency matrix A(G). In this paper we characterize the extremal tree with given domination number that attains the maximum index.

引用

页码：520 / 525

页数：6

共 6 条

[1] Minimizing the Laplacian eigenvalues for trees with given domination number
Feng, Lihua
Yu, Guihai
Li, Qiao
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 419 (2-3) : 648 - 655
[2] On the spectral radius of trees with fixed diameter
Guo, JM
Shao, JY
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 413 (01) : 131 - 147
[3] GUO JM, 2001, LINEAR ALGEBRA APPL, V329, P1
[4] On the spectral radius of bicyclic graphs with n vertices and diameter d
Guo, Shu-Guang
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 422 (01) : 119 - 132
[5] The spectral radius of trees on k pendant vertices
Wu, BF
Xiao, E
Hong, Y
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 395 : 343 - 349
[6] Xu G.H., 1997, Combinatorics and Graph Theory

← 1 →