Edge Weighting Functions on Dominating Sets

DOI10.1002/jgt.21649zbMath1261.05080OpenAlexW1524129729MaRDI QIDQ4916094

Justin Southey, Michael A. Henning

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21649

zbMATH Keywords

regular graphsdominating setsupper domination numberupper total domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Total dominating sequences in graphs ⋮ 2-limited broadcast domination in subcubic graphs ⋮ Total domination versus domination in cubic graphs ⋮ The enclaveless competition game ⋮ Edge weighting functions on semitotal dominating sets ⋮ Algorithmic aspects of upper paired-domination in graphs ⋮ Upper total domination in claw-free cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the upper total domination number of Cartesian products of graphs
• On the computational complexity of upper total domination
• Upper domination and upper irredundance perfect graphs
• Fault-tolerant locating-dominating sets
• Vertex criticality for upper domination and irredundance
• A semi-induced subgraph characterization of upper domination perfect graphs
• Upper total domination in claw‐free graphs

This page was built for publication: Edge Weighting Functions on Dominating Sets