Graphs with unique maximum packing of closed neighborhoods

DOI10.7151/dmgt.2304zbMath1492.05126OpenAlexW3008971715MaRDI QIDQ2151212

Dragana Božović, Iztok Peterin

Publication date: 1 July 2022

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

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

zbMATH Keywords

treesclosed neighborhoodsunique maximum packing

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Dominating sets, packings, and the maximum degree
• Limited packings in graphs
• Graphs with unique maximum independent sets
• Relations between packing and covering numbers of a tree
• On the number of 2-packings in a connected graph
• Packing parameters in graphs
• The probabilistic approach to limited packings in graphs
• Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
• Perfect codes in graphs
• Trees with unique minimum total dominating sets
• On the packing numbers in graphs
• Cartesian product graphs and k-tuple total domination
• The number of maximum independent sets in graphs

This page was built for publication: Graphs with unique maximum packing of closed neighborhoods