The Bondage Number of Mesh Networks

DOI10.1007/S11464-012-0173-XMaRDI QIDQ6227841arXivFDO

Authors Fu-Tao Hu, Jun-Ming Xu

Publication date 18 September 2011

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11464-012-0173-X

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)

arXiv classification

math.CO

Abstract: The bondage number $b(G)$ of a nonempty graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with domination number greater than that of $G$. Denote $P_{n}imes{P}_m$ be the Cartesian product of two paths $P_n$ and $P_m$. This paper determines that the exact value of $b(P_{n}imes{P}_2)$, $b(P_{n}imes{P}_3)$ and $b(P_{n}imes{P}_4)$ for $nge2$.

This page was built for publication: The Bondage Number of Mesh Networks

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