A sharp upper bound on algebraic connectivity using domination number

DOI10.1016/J.LAA.2009.12.031MaRDI QIDQ967504zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Mustapha Aouchiche, Dragan Stevanović

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

algebraic connectivitydomination numberextremal graphLaplacian

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7473309
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• Bounds of Laplacian spectrum of graphs based on the domination number
• LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
• The k-domination number and bounds for the Laplacian eigenvalues of graphs

Cites work

• AutoGraphiX: a survey
• Bounds of Laplacian spectrum of graphs based on the domination number
• Bounds on graph eigenvalues. I
• Domination in graphs of minimum degree five
• Domination-balanced graphs
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3531438 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1472173 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Old and new results on algebraic connectivity of graphs
• On graphs having domination number half their order
• Paths, Stars and the Number Three
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree
• Upper bounds on the domination number of a graph in terms of order and minimum degree.
• Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system

Cited in

(11)

• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• The spectral radius and domination number in linear uniform hypergraphs
• A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
• A lower bound for algebraic connectivity based on the connection-graph-stability method
• The sharpness of a lower bound on the algebraic connectivity for maximal graphs
• An upper bound on algebraic connectivity of graphs with many cutpoints
• Domination and spectral graph theory
• Bounds of Laplacian spectrum of graphs based on the domination number
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Open problems on graph eigenvalues studied with AutoGraphiX
• Domination number and Laplacian eigenvalue distribution

Describes a project that uses

Uses Software

• AutoGraphiX

This page was built for publication: A sharp upper bound on algebraic connectivity using domination number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967504)