The bondage numbers and efficient dominations of vertex-transitive graphs

DOI10.1016/j.disc.2007.03.027zbMath1130.05043OpenAlexW2104479384MaRDI QIDQ2467738

Jia Huang, Jun-Ming Xu

Publication date: 28 January 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.027

zbMATH Keywords

vertex-transitive graphefficient dominating setbondage number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items

Domination ratio of a family of integer distance digraphs with arbitrary degree, The fullerene graphs with a perfect star packing, Efficient domination in Cayley graphs of generalized dihedral groups, Eternal \(m\)-security bondage numbers in graphs, Subgroups as efficient dominating sets in Cayley graphs, Domination ratio of integer distance digraphs, Efficient dominating sets in circulant graphs with domination number prime, Bondage number of strong product of two paths, Efficient closed domination in digraph products, On bondage numbers of graphs: a survey with some comments, Efficient domination in cubic vertex-transitive graphs, On efficiently total dominatable digraphs, Efficient open domination in Cayley graphs, Total and paired domination numbers of toroidal meshes, The \(p\)-bondage number of trees, Upper bounds on the bondage number of the strong product of a graph and a tree, Efficient absorbants in generalized de Bruijn digraphs, Efficient dominating sets in circulant graphs, Bondage number of mesh networks, The total bondage number of grid graphs, Bondage numbers of Mycielski graphs, Common extremal graphs for three inequalities involving domination parameters, On efficient absorbant conjecture in generalized De Bruijn digraphs, Reinforcement numbers of digraphs, Domination in Cayley graphs: a survey

Cites Work

• The bondage number of a graph
• Bounds on the bondage number of a graph
• Efficient domination of the orientations of a graph
• Efficient dominating sets in Cayley graphs.
• The bondage numbers of extended de Bruijn and Kautz digraphs
• On the bondage number of planar and directed graphs
• Bondage number of the discrete torus \(C_n\times C_4\)
• Independent perfect domination sets in Cayley graphs
• Theory and Application of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item