Bondage number of strong product of two paths

DOI10.1007/s11464-014-0391-5zbMath1326.05116OpenAlexW2050595285MaRDI QIDQ893339

Heping Zhang, Weisheng Zhao

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

pathstrong productbondage number

Mathematics Subject Classification ID

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 (2)

Bondage number of the strong product of two trees ⋮ Upper bounds on the bondage number of the strong product of a graph and a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the bondage and reinforcement problems
• Bondage number of mesh networks
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of a graph
• Relations between packing and covering numbers of a tree
• New results about 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
• 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 C₃×C_n

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