Bondage number of strong product of two paths

DOI10.1007/S11464-014-0391-5zbMATH Open1326.05116OpenAlexW2050595285MaRDI QIDQ893339FDOQ893339

Authors Weisheng Zhao, Heping Zhang 

Publication date 19 November 2015

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-014-0391-5

zbMATH Keywords

strong productbondage numberpath

Mathematics Subject Classification ID

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

Recommendations

• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• Bondage number of the strong product of two trees
• Upper bounds on the bondage number of a graph
• Bondage number of mesh networks
• Bondage number of grid graphs

Cites Work

• scientific article; zbMATH DE number 3902703 (Why is no real title available?)
• scientific article; zbMATH DE number 1124610 (Why is no real title available?)
• scientific article; zbMATH DE number 1123784 (Why is no real title available?)
• Associative graph products and their independence, domination and coloring numbers
• Bondage number of mesh networks
• Bondage number of the discrete torus \(C_n\times C_4\)
• Domination and bondage number of \(C_5\times C_n\).
• Handbook of product graphs
• New results about the bondage number of a graph
• On the complexity of the bondage and reinforcement problems
• Relations between packing and covering numbers of a tree
• THE BONDAGE NUMBER OF C₃×C_n
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of a graph
• The bondage numbers and efficient dominations of vertex-transitive graphs
• The bondage numbers of extended de Bruijn and Kautz digraphs

Cited In (6)

• Bondage number of grid graphs
• Toughness and binding number bounds of star-like and path factor
• Upper bounds on the bondage number of the strong product of a graph and a tree
• Bondage number of mesh networks
• Bondage number of the strong product of two trees
• 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 strong product of two paths

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