Packing in regular graphs

DOI10.2989/16073606.2017.1398193zbMath1395.05132OpenAlexW2767892248MaRDI QIDQ5375889

Michael A. Henning, William F. Klostermeyer

Publication date: 17 September 2018

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1398193

zbMATH Keywords

packingregular graphsMoore graphs

Mathematics Subject Classification ID

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

Related Items (2)

Further results on the independent Roman domination number of graphs ⋮ Vertex-edge domination in cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound on the independence number of a graph and applications
• Structural properties of graphs of diameter 2 and defect 2
• Independence, clique size and maximum degree
• Relations between packing and covering numbers of a tree
• Signed domination in regular graphs
• Graphs of diameter 2 with cyclic defect
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• Total Domination in Graphs
• A Taxonomy of Perfect Domination
• There is No Irregular Moore Graph
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Packing in regular graphs