On the \([1,2]\)-domination number of generalized Petersen graphs
From MaRDI portal
Publication:2424833
DOI10.1016/j.amc.2018.01.013zbMath1426.05128OpenAlexW2790987837MaRDI QIDQ2424833
Yingbin Ma, Yongtang Shi, Lily Chen, Yan Zhao
Publication date: 25 June 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.01.013
generalized Petersen graphdomination number\([12\)-domination number]
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The bondage number of generalized Petersen graphs \(P(n,2)\) ⋮ 3-component domination numbers in graphs ⋮ The metric dimension of some generalized Petersen graphs ⋮ Integer linear programming models for the weighted total domination problem ⋮ Outer independent double Roman domination ⋮ Statistical mechanics of the directed 2-distance minimal dominating set problem ⋮ On the double Roman domination of graphs
Cites Work
- \([1,2\)-domination in graphs]
- Vertex domination of generalized Petersen graphs
- \([1,2\)-sets in graphs]
- Quasiperfect domination in triangular lattices
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item