𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Sharp Upper Bound on the Least Signless Laplacian Eigenvalue Using Domination Number

✍ Scribed by Chang-Xiang He, Min Zhou

Book ID
120788866
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
261 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp upper bound on algebraic connect
A sharp upper bound on algebraic connectivity using domination number
✍ M. Aouchiche; P. Hansen; D. StevanoviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 760 KB

Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the

A sharp lower bound for the least eigenv
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
✍ Domingos M. Cardoso; DragoΕ‘ CvetkoviΔ‡; Peter Rowlinson; Slobodan K. SimiΔ‡ πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 149 KB

We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices.

A sharp upper bound on the largest Lapla
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
✍ Kinkar Ch. Das; R.B. Bapat πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and