Upper bounds on the bondage number of the strong product of a graph and a tree

DOI10.1080/00207160.2017.1291931zbMath1390.05183OpenAlexW2588261182MaRDI QIDQ4641566

Heping Zhang, Weisheng Zhao

Publication date: 17 May 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1291931

zbMATH Keywords

treestrong productbondage number

Mathematics Subject Classification ID

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 ⋮ Construction for trees without domination critical vertices ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Matching preclusion for direct product of regular graphs

Cites Work

• Upper bounds for the bondage number of graphs on topological surfaces
• On the complexity of the bondage and reinforcement problems
• Domination alteration sets in graphs
• Bondage number of mesh networks
• Bondage number of strong product of two paths
• The bondage number of a graph
• Relations between packing and covering numbers of a tree
• A bound on the size of a graph with given order and bondage number
• Bounds on the bondage number of a graph
• New results about the bondage number of a graph
• Remarks on the bondage number of planar graphs
• On bondage numbers of graphs: a survey with some comments
• \(\alpha_k\)- and \(\gamma_k\)-stable graphs
• Bondage number of grid graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Bondage number of the discrete torus \(C_n\times C_4\)
• Associative graph products and their independence, domination and coloring numbers
• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• THE BONDAGE NUMBER OF C₃×C_n
• 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: Upper bounds on the bondage number of the strong product of a graph and a tree