The bondage numbers and efficient dominations of vertex-transitive graphs

DOI10.1016/j.disc.2007.03.027zbMath1130.05043MaRDI 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 graph; efficient dominating set; bondage number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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