On the 2-packing differential of a graph

DOI10.1007/s00025-021-01473-8zbMath1470.05125arXiv2105.13438OpenAlexW3178267986MaRDI QIDQ2044595

María Luz Puertas, Juan Alberto Rodríguez-Velázquez, Abel Cabrera Martínez

Publication date: 10 August 2021

Published in: Results in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

differential of a graph2-packing differentialunique response Roman domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On the D-differential of a graph ⋮ From the strong differential to Italian domination in graphs

Cites Work

• Relations between the differential and parameters in graphs
• On the roman domination in the lexicographic product of graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Double domination in lexicographic product graphs
• Relations between packing and covering numbers of a tree
• Roman domination in graphs.
• A note on double domination in graphs
• Protection of lexicographic product graphs
• Unique response Roman domination in graphs
• Total Roman domination in the lexicographic product of graphs
• On the super domination number of lexicographic product graphs
• On the weak Roman domination number of lexicographic product graphs
• Rainbow domination in the lexicographic product of graphs
• Roman dominating influence parameters
• Associative graph products and their independence, domination and coloring numbers
• Open k-monopolies in graphs: complexity and related concepts
• On Complementary Graphs
• Closed formulas for the total Roman domination number of lexicographic product graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the 2-packing differential of a graph