The bondage number of the strong product of a complete graph with a path and a special starlike tree

DOI10.1142/S1793830916500063zbMath1338.05204arXiv1312.7434MaRDI QIDQ2798318

Heping Zhang, Weisheng Zhao

Publication date: 12 April 2016

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

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

zbMATH Keywords

complete graphstrong product of graphsbondage number

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Bondage number of the strong product of two trees ⋮ Restrained Italian bondage number in graphs ⋮ Unnamed Item ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree

Cites Work

• Domination alteration sets in graphs
• The bondage number in complete \(t\)-partite digraphs
• Relations between packing and covering numbers of a tree
• On bondage numbers of graphs: a survey with some comments
• Bondage number of grid graphs
• The bondage numbers of extended de Bruijn and Kautz digraphs
• THE BONDAGE NUMBER OF C₃×C_n
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The bondage number of the strong product of a complete graph with a path and a special starlike tree