Signed domination numbers of a graph and its complement
From MaRDI portal
Publication:1827775
DOI10.1016/j.disc.2004.01.007zbMath1042.05071MaRDI QIDQ1827775
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.007
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, A note on the signed edge domination number in graphs, Domination in commuting graph and its complement, Signed (total) domination numbers and Laplacian spectrum of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the lower bounds of signed domination number of a graph
- Signed domination in regular graphs and set-systems
- \(k\)-subdomination in graphs
- Signed domination in regular graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- Nordhaus-Gaddum results for CO-irredundance in graphs
- On Complementary Graphs