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

Domination, eternal domination, and clique covering

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

DOI10.7151/dmgt.1799zbMath1311.05151arXiv1407.5235OpenAlexW2963899823MaRDI QIDQ2344016

William F. Klostermeyer, Christina M. Mynhardt

Publication date: 11 May 2015

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

Full work available at URL: https://arxiv.org/abs/1407.5235


zbMATH Keywords

independent setdominating seteternal dominating setclique cover


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items

Eternal domination and clique covering ⋮ Eternal domination on prisms of graphs ⋮ Eternal and Secure Domination in Graphs ⋮ On eternal domination and Vizing-type inequalities



Cites Work

  • Vertex covers and eternal dominating sets
  • Eternally secure sets, independence sets and cliques
  • Tight bounds for eternal dominating sets in graphs
  • Graph-theoretic parameters concerning domination, independence, and irredundance
  • Protecting a graph with mobile guards
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2344016&oldid=14945978"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 17:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki