Power domination in the generalized Petersen graphs
From MaRDI portal
Publication:2175230
DOI10.7151/dmgt.2137zbMath1439.05181OpenAlexW2883954391MaRDI QIDQ2175230
Min Zhao, Erfang Shan, Li-ying Kang
Publication date: 28 April 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2137
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
- On the power domination number of the generalized Petersen graphs
- The exact domination number of the generalized Petersen graphs
- Power domination in circular-arc graphs
- On the domination number of the generalized Petersen graphs
- Power domination in graphs
- Power domination in block graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Domination in generalized Petersen graphs
- Power Domination in Product Graphs
- Domination in Graphs Applied to Electric Power Networks
- The PMU Placement Problem
- Fundamentals of Computation Theory
- Computing and Combinatorics
This page was built for publication: Power domination in the generalized Petersen graphs