Dominating Sets and Eigenvalues of Graphs

DOI10.1112/BLMS/26.3.248MaRDI QIDQ4314579zbMATH OpenOpenAlexFDO

Authors P. Rowlinson

Publication date 23 November 1994

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/26.3.248

zbMATH Keywords

dominating setdomination numbereigenvaluespectraspectral decompositionstar partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 1746416
• Dominating properties of star complements
• Star partitions and regularity in graphs
• scientific article; zbMATH DE number 1529454
• On some algorithmic investigations of star partitions of graphs

Cited in

(11)

• Star partitions and regularity in graphs
• A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
• The main vertices of a star set and related graph parameters
• On independent star sets in finite graphs
• Dominating properties of star complements
• Efficient domination through eigenvalues
• Domination and spectral graph theory
• scientific article; zbMATH DE number 1746416 (Why is no real title available?)
• Statistical mechanics of two hard spheres in a spherical pore, exact analytic results in D dimension
• Domination number and Laplacian eigenvalue distribution
• Star complements in regular graphs: old and new results

This page was built for publication: Dominating Sets and Eigenvalues of Graphs

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