(Open) packing number of some graph products

DOI10.23638/DMTCS-22-4-1zbMath1455.05060arXiv1901.06813MaRDI QIDQ3386621

Babak Samadi, Ismael González Yero, Doost Ali Mojdeh, Iztok Peterin

Publication date: 5 January 2021

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

zbMATH Keywords

packing numbergraph productsopen packing number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Packings in bipartite prisms and hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Dominating sets, packings, and the maximum degree
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Limited packings in graphs
• Relations between packing and covering numbers of a tree
• On the \(k\)-limited packing numbers in graphs
• 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
• Total limited packing in graphs
• Perfect codes in graphs
• Open k-monopolies in graphs: complexity and related concepts
• Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
• Vizing's conjecture: a survey and recent results
• A new graph product and its spectrum
• On the packing numbers in graphs
• Cartesian product graphs and k-tuple total domination
• Total Domination in Categorical Products of Graphs

This page was built for publication: (Open) packing number of some graph products