Signed (total) domination numbers and Laplacian spectrum of graphs
DOI10.1080/09720529.2009.10698220zbMath1175.05101OpenAlexW1985280246MaRDI QIDQ3634013
A. N. Ghameshlou, Seyyed Mahmoud Sheikholeslami
Publication date: 23 June 2009
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2009.10698220
signed domination numberweightsigned total domination numbersigned total dominating functionsigned dominating functioneigenvalues of Laplacian matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Bounds of Laplacian spectrum of graphs based on the domination number
- On graphs with algebraic connectivity equal to minimum edge density
- Signed total domination in graphs.
- \(k\)-subdomination in graphs
- Signed domination in regular graphs
- Signed domination numbers of a graph and its complement
- Interlacing eigenvalues and graphs
- Signed domatic number of a graph
- Signed Total Domination Nnumber of a Graph
This page was built for publication: Signed (total) domination numbers and Laplacian spectrum of graphs