A sharp upper bound on algebraic connectivity using domination number

DOI10.1016/j.laa.2009.12.031zbMath1195.05035OpenAlexW2161642992MaRDI QIDQ967504

Pierre Hansen, Dragan Stevanović, Mustapha Aouchiche

Publication date: 29 April 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.12.031

zbMATH Keywords

Laplaciandomination numberextremal graphalgebraic connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Domination number and Laplacian eigenvalue distribution, A sharp upper bound on the least signless Laplacian eigenvalue using domination number, Open problems on graph eigenvalues studied with AutoGraphiX, The spectral radius and domination number in linear uniform hypergraphs, Domination and Spectral Graph Theory, A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds of Laplacian spectrum of graphs based on the domination number
• Bounds on graph eigenvalues. I
• Old and new results on algebraic connectivity of graphs
• On graphs having domination number half their order
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Domination in graphs of minimum degree five
• AutoGraphiX: a survey
• Domination-balanced graphs
• Paths, Stars and the Number Three