Bondage number of the strong product of two trees

DOI10.1016/j.dam.2017.06.019zbMath1368.05123OpenAlexW2736372520MaRDI QIDQ2399299

Hao Li, Fan Wang, Xiaolu Gao, Weisheng Zhao

Publication date: 22 August 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.019

zbMATH Keywords

strong productbondage number

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Construction for trees without domination critical vertices ⋮ On construction for trees making the equality hold in Vizing's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Bounds on the bondage number of a graph
• New results about the bondage number of a graph
• On bondage numbers of graphs: a survey with some comments
• Bondage number of grid 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
• Upper bounds on the bondage number of the strong product of a graph and a tree
• THE BONDAGE NUMBER OF C₃×C_n

This page was built for publication: Bondage number of the strong product of two trees