A note on the open packing number in graphs

DOI10.21136/MB.2018.0124-17zbMATH Open1474.05324WikidataQ129222157 ScholiaQ129222157MaRDI QIDQ5227166FDOQ5227166

Authors: Mehdi Mohammadi, M. Maghasedi 

Publication date: 5 August 2019

Published in: Mathematica Bohemica (Search for Journal in Brave)

Recommendations

• On open packing number of graphs
• Packing parameters in graphs
• Further results on packing related parameters in graphs
• scientific article; zbMATH DE number 1286740
• Open packing number for some classes of perfect graphs

zbMATH Keywords

packingtotal dominationopen packing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Perfect codes in graphs
• Total domination in graphs
• Some remarks on domination
• Total domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relations between packing and covering numbers of a tree
• On packing and covering numbers of graphs
• Packing in trees
• Title not available (Why is that?)
• Packing parameters in graphs
• Total Domination in Categorical Products of Graphs
• Title not available (Why is that?)
• On Open Packing Number of Graphs

Cited In (3)

• Open packing, total domination, and the \(P_3\)-Radon number
• Packings in bipartite prisms and hypercubes
• Outer-connected open packing sets in graphs

This page was built for publication: A note on the open packing number in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227166)