The bondage number of (n-3)-regular graphs of order n.

zbMATH Open1349.05256arXiv1109.3931MaRDI QIDQ2804844FDOQ2804844

Authors: Fu-Tao Hu, Jun-Ming Xu 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Abstract: Let $G=(V,E)$ be a graph. A subset $DsubseteqV$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$ is the smallest cardinality of a dominating set of $G$. The bondage number of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number of $G$. In this paper, we determine that the exact value of the bondage number of $(n-3)$-regular graph $G$ of order $n$ is $n-3$.

Full work available at URL: https://arxiv.org/abs/1109.3931

Recommendations

• The bondage number of a graph
• scientific article; zbMATH DE number 876673
• New results about the bondage number of a graph
• THE BONDAGE NUMBER OF C₃×C_n
• On the bondage number of a graph

zbMATH Keywords

domination numberbondage numberregular graph

Mathematics Subject Classification ID

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

This page was built for publication: The bondage number of \((n-3)\)-regular graphs of order \(n\).

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