Open packing bondage number of a graph

DOI10.1142/S1793830919500514zbMath1426.05134OpenAlexW2967398361WikidataQ127369115 ScholiaQ127369115MaRDI QIDQ5242822

No author found.

Publication date: 7 November 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500514

zbMATH Keywords

bondage numberopen packing number

Mathematics Subject Classification ID

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

Cites Work

• Domination alteration sets in graphs
• The bondage number of a graph
• Relations between packing and covering numbers of a tree
• On bondage numbers of graphs: a survey with some comments
• Packing parameters in graphs
• Changing and unchanging Open Packing: Edge removal
• UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE
• On Open Packing Number of Graphs
• Effect of Open Packing upon Vertex Removal
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open packing bondage number of a graph