Bondage number of the strong product of two trees

DOI10.1016/J.DAM.2017.06.019MaRDI QIDQ2399299zbMATH OpenOpenAlexFDO

Authors Weisheng Zhao, F. Wang, Xiaolu Gao, Hao Li

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)

Recommendations

• Upper bounds on the bondage number of the strong product of a graph and a tree
• Bondage number of strong product of two paths
• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• scientific article; zbMATH DE number 2109033
• Bondage number of grid graphs

Cites work

• scientific article; zbMATH DE number 1109414 (Why is no real title available?)
• scientific article; zbMATH DE number 1124610 (Why is no real title available?)
• Associative graph products and their independence, domination and coloring numbers
• Bondage number of grid graphs
• Bondage number of mesh networks
• Bondage number of strong product of two paths
• Bondage number of the discrete torus \(C_n\times C_4\)
• Bounds on the bondage number of a graph
• Connectivity and edge-connectivity of strong product graphs
• Domination alteration sets in graphs
• Domination and bondage number of \(C_5\times C_n\).
• Handbook of product graphs
• New results about the bondage number of a graph
• On bondage numbers of graphs: a survey with some comments
• On the complexity of the bondage and reinforcement problems
• THE BONDAGE NUMBER OF C₃×C_n
• The bondage number of a graph
• 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

Cited in

(6)

• scientific article; zbMATH DE number 2109033 (Why is no real title available?)
• On construction for trees making the equality hold in Vizing's conjecture
• Upper bounds on the bondage number of the strong product of a graph and a tree
• Bondage number of strong product of two paths
• Construction for trees without domination critical vertices
• The bondage number of the strong product of a complete graph with a path and a special starlike tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399299)