Title of article
Bounds of Laplacian spectrum of graphs based on the domination number Original Research Article
Author/Authors
Mei Lu & Mary B. Watson-Manheim، نويسنده , , Huiqing Liu، نويسنده , , Feng Tian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
390
To page
396
Abstract
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.
Keywords
graph , Laplacian spectrum , Domination number
Journal title
Linear Algebra and its Applications
Serial Year
2005
Journal title
Linear Algebra and its Applications
Record number
824836
Link To Document