On the spectral radius of graphs with a given domination number

DOI10.1016/J.LAA.2007.10.024zbMATH Open1143.05042OpenAlexW1967121281MaRDI QIDQ2479498FDOQ2479498

Mustapha Aouchiche, Pierre Hansen, Dragan Stevanović

Publication date: 26 March 2008

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

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

zbMATH Keywords

domination numberspectral radiusadjacency matrixsplit graphextremal graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Eigenspaces of graphs
• On the spectral radius of graphs with cut vertices
• Maximum number of edges in connected graphs with a given domination number
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• More on Graph Perturbations
• Domination critical graphs
• Bounds on graph eigenvalues. II
• A bound on the spectral radius of graphs
• Spectral radii of graphs with given chromatic number
• Spectral radius of graphs with given matching number
• Anticritical graphs

Cited In (30)

• The spectral radius of graphs with no odd wheels
• The spectral radius of edge chromatic critical graphs
• A Spectral Erdős-Sós Theorem
• Variable neighbourhood search: Methods and applications
• The spectral even cycle problem
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• Resolution of AutoGraphiX conjectures relating the index and matching number of graphs
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• Variable neighbourhood search: methods and applications
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• The least eigenvalue of a graph with a given domination number
• Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
• The maximum spectral radius of graphs without friendship subgraphs
• Measure-theoretic bounds on the spectral radius of graphs from walks
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
• Open problems on graph eigenvalues studied with AutoGraphiX
• The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
• Spectral Turán problems for intersecting even cycles
• On the α-spectral radius of graphs
• Disproof of a conjecture on the minimum spectral radius and the domination number
• Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
• Maxima of the \(A_\alpha\)-index of graphs with given size and domination number
• Graphs with the minimum spectral radius for given independence number
• Domination and Spectral Graph Theory
• Spectral conditions for graphs to be β-deficient involving minimum degree
• The minimum spectral radius of graphs with a given domination number
• Spectral radius and \(k\)-connectedness of a graph
• A survey of automated conjectures in spectral graph theory
• Spectral conditions for some graphical properties

Uses Software

• AutoGraphiX

This page was built for publication: On the spectral radius of graphs with a given domination number

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