Bondage number of mesh networks

DOI10.1007/S11464-012-0173-XMaRDI QIDQ692637zbMATH OpenOpenAlexFDO

Authors Fu-Tao Hu, Jun-Ming Xu

Publication date 6 December 2012

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

Full work available at URL https://doi.org/10.1007/s11464-012-0173-x

zbMATH Keywords

domination numberdominating setbondage numbermesh network

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Recommendations

• Bondage number of grid graphs
• Bondage number of strong product of two paths
• Bondage number of the discrete torus \(C_n\times C_4\)
• THE BONDAGE NUMBER OF C₃×C_n
• The bondage number of the strong product of a complete graph with a path and a special starlike tree

Cites work

• scientific article; zbMATH DE number 3902703 (Why is no real title available?)
• scientific article; zbMATH DE number 68339 (Why is no real title available?)
• scientific article; zbMATH DE number 734463 (Why is no real title available?)
• scientific article; zbMATH DE number 1109414 (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?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 825127 (Why is no real title available?)
• scientific article; zbMATH DE number 1409199 (Why is no real title available?)
• Bondage number of planar graphs
• Bondage number of the discrete torus \(C_n\times C_4\)
• Bounds on the bondage number of a graph
• Dominating Cartesian products of cycles
• Domination alteration sets in graphs
• Domination and bondage number of \(C_5\times C_n\).
• New results about the bondage number of a graph
• On the bondage number of planar and directed graphs
• On the complexity of the bondage and reinforcement problems
• Paired bondage in trees
• Restrained bondage in graphs
• THE BONDAGE NUMBER OF C₃×C_n
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of a graph
• The bondage number of graphs with crossing number less than four
• The bondage numbers and efficient dominations of vertex-transitive graphs
• The bondage numbers of extended de Bruijn and Kautz digraphs
• The bondage numbers of graphs with small crossing numbers
• The domination numbers of the 5 × n and 6 × n grid graphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• Theory and Application of Graphs
• \(\alpha_k\)- and \(\gamma_k\)-stable graphs

Cited in

(12)

• Bondage number of grid graphs
• Semitotal bondage numbers of graphs
• Upper bounds on the bondage number of the strong product of a graph and a tree
• The independent transversal dombondage number of a graph
• Bondage number of strong product of two paths
• On bondage numbers of graphs: a survey with some comments
• Bondage numbers of \(C_4\) bundles over a cycle \(C_n\)
• Bondage number of the strong product of two trees
• The Bondage Number of Mesh Networks
• The bondage number of generalized Petersen graphs \(P(n,2)\)
• The bondage number of the strong product of a complete graph with a path and a special starlike tree
• Bondage number of the discrete torus \(C_n\times C_4\)

This page was built for publication: Bondage number of mesh networks

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