Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Eternal domination: criticality and reachability

From MaRDI portal
Publication:505466
Jump to:navigation, search

DOI10.7151/DMGT.1918zbMath1354.05108OpenAlexW2519122935MaRDI QIDQ505466

William F. Klostermeyer, Gary MacGillivray

Publication date: 23 January 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1918


zbMATH Keywords

dominating setcritical graphseternal dominating set


Mathematics Subject Classification ID

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


Related Items (1)

Eternal and Secure Domination in Graphs




Cites Work

  • The \(k\)-dominating graph
  • γ-graphs of graphs
  • Vertex domination-critical graphs
  • Vertex domination‐critical graphs
  • Protecting a graph with mobile guards
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Eternal domination: criticality and reachability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:505466&oldid=12388882"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 06:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki