The bondage number of generalized Petersen graphs P(n,2)

DOI10.1155/2020/7607856MaRDI QIDQ2188017zbMATH OpenOpenAlexFDO

Authors Lidan Pei, Xiang-Feng Pan

Publication date 3 June 2020

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/7607856

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Review text

Summary: The domination number \(\gamma\left( G\right)\) of a nonempty graph \(G\) is the minimum cardinality among all subsets \(D\subseteq V\left( G\right)\) such that \(N_G\left[ D\right]=V\left( G\right)\). The bondage number \(b\left( G\right)\) of a graph \(G\) is the smallest number of edges whose removal from \(G\) results in a graph with larger domination number. The exact value of \(b\left( P \left( n , 2\right)\right)\) for \(n=0,3,4\pmod{5}\) and the bounds of \(b\left( P \left( n , 2\right)\right)\) for \(n=1,2\pmod{5}\) are determined.

Recommendations

• The 2-rainbow bondage number in generalized Petersen graphs
• On the domination number of generalized petersen graphs \(P(n,2)\)
• THE BONDAGE NUMBER OF C₃×C_n
• scientific article; zbMATH DE number 876673
• The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)

Cites work

• 2-domination number of generalized Petersen graphs
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• 2-rainbow domination of generalized Petersen graphs P(n,2)
• _k- and _k-stable graphs
• Bondage number of grid graphs
• Bondage number of mesh networks
• Bondage number of the discrete torus \(C_n\times C_4\)
• Bondage numbers of Mycielski graphs
• Domination alteration sets in graphs
• Domination and bondage number of C₅ C_n.
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1123784 (Why is no real title available?)
• New results about the bondage number of a graph
• On 2-rainbow domination of generalized Petersen graphs
• On bondage numbers of graphs: a survey with some comments
• On the \([1,2]\)-domination number of generalized Petersen graphs
• On the complexity of the bondage and reinforcement problems
• On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
• On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
• On the domination number of generalized petersen graphs \(P(n,2)\)
• On the domination number of the generalized Petersen graphs
• On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
• Perfect 2-colorings of the generalized Petersen graph
• The bondage number in complete \(t\)-partite digraphs
• The bondage number of a graph
• THE BONDAGE NUMBER OF C₃×C_n
• The bondage numbers of extended de Bruijn and Kautz digraphs
• The exact domination number of the generalized Petersen graphs
• The metric dimension of some generalized Petersen graphs
• The total bondage numbers and efficient total dominations of vertex-transitive graphs
• Theory and Application of Graphs
• Valency-based topological descriptors and structural property of the generalized Sierpiński networks

Cited in

(3)

• Domination and bondage number of C₅ C_n.
• The bondage number of some graphs
• THE BONDAGE NUMBER OF C₃×C_n

This page was built for publication: The bondage number of generalized Petersen graphs \(P(n,2)\)

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