Bounds on the largest of minimum degree Laplician eigenvalues of a graph

In this paper we give three upper bounds for the largest of minimum degree Laplacian eigenvalues of a graph and also obtain a lower bound for the same. Key Words: Minimum degree matrix, minimum degree Laplacian eigenvalues. AMS(20 10): 05C50

Saved in:
Bibliographic Details
Published inInternational journal of mathematical combinatorics Vol. 2; p. 130
Main Authors Adiga, Chandrashekar, Swamy, C.S. Shivakumar
Format Journal Article
LanguageEnglish
Published Gallup Neutrosophic Sets and Systems 01.07.2011
Science Seeking - distributor
Subjects
Combinatorics
Eigenvalues
Graph theory
Graphic methods
Graphs
Laplace transformation
Mathematics
India
Online AccessGet full text

Cover

More Information
Summary:In this paper we give three upper bounds for the largest of minimum degree Laplacian eigenvalues of a graph and also obtain a lower bound for the same. Key Words: Minimum degree matrix, minimum degree Laplacian eigenvalues. AMS(20 10): 05C50
ISSN:1937-1055
1937-1047