Bounds of Laplacian spectrum of graphs based on the domination number

被引：23

作者：

Lu, M ^{[1
]}

Liu, HQ

Tian, F

机构：

[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China

[2] Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China

[3] Nankai Univ, LPMC, Tianjin 300071, Peoples R China

[4] Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2005年 / 402卷

关键词：

graph; Laplacian spectrum; domination number;

D O I：

10.1016/j.laa.2005.01.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a connected graph of order n. A dominating set in G is a subset S of V(G) such that each element of V(G) - S is adjacent to a vertex of S. The least cardinality of a dominating set is the domination number. In the paper, we will give bounds of the Laplacian spectrum of G involving the domination number. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：390 / 396

页数：7

共 16 条

[1]

[Anonymous], LINEAR ALGEBRA APPL

[2] On graphs with algebraic connectivity equal to minimum edge density [J].

Fallat, SM ;

Kirkland, S ;

Pati, S .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 373 :31-50

[3]

FIEDLER M, 1973, CZECH MATH J, V23, P298

[4] THE LAPLACIAN SPECTRUM OF A GRAPH .2. [J].

GRONE, R ;

MERRIS, R .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (02) :221-229

[5]

GRONE R, 1987, CZECH MATH J, V37, P660

[6]

HAEMERS W, 1978, P K NED AKAD A MATH, V81, P445

[7] INTERLACING EIGENVALUES AND GRAPHS [J].

HAEMERS, WH .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 226 :593-616

[8] A bound on the algebraic connectivity of a graph in terms of the number of cutpoints [J].

Kirkland, S .

LINEAR & MULTILINEAR ALGEBRA, 2000, 47 (01) :93-103

[9] On the Laplacian eigenvalues of a graph [J].

Li, JS ;

Zhang, XD .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 285 (1-3) :305-307

[10]

Li JS, 1997, LINEAR ALGEBRA APPL, V265, P93

← 1 2 →