On perfect and quasiperfect dominations in graphs

DOI10.2298/FIL1702413CzbMath1488.05365arXiv1411.7818MaRDI QIDQ5005483

Jose Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas

Publication date: 10 August 2021

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

cographsdominationclaw-free graphsperfect dominationquasiperfect domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \([1,2\)-domination in graphs]
• Fair domination in graphs
• Perfect domination sets in Cayley graphs
• Complement reducible graphs
• Extremal graphs for inequalities involving domination parameters
• \([1,2\)-sets in graphs]
• Perfect codes in graphs
• Perfect domination in rectangular grid graphs
• The Pathwidth and Treewidth of Cographs
• Quasiperfect domination in triangular lattices

This page was built for publication: On perfect and quasiperfect dominations in graphs