2-power domination number for Knödel graphs and its application in communication networks
From MaRDI portal
Publication:6181254
DOI10.1051/ro/2023173MaRDI QIDQ6181254
No author found.
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Power domination of the Cartesian product of graphs
- Generalized power domination of graphs
- On the \({k}\)-power domination of hypergraphs
- New gossips and telephones
- A survey on Knödel graphs.
- Power domination in Knödel graphs and Hanoi graphs
- Domination in 4-regular Knödel graphs
- An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs
- Generalized power domination: propagation radius and Sierpiński graphs
- The \(k\)-power domination problem in weighted trees
- A note on power domination in grid graphs
- Power domination in graphs
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
- Tight Bound on the Diameter of the Knödel Graph
- Generalized Power Domination in Regular Graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Domination in Graphs Applied to Electric Power Networks
- Total domination in cubic Knodel graphs
- A note on the double domination number in maximal outerplanar and planar graphs
- Optimal PMU placement problem in octahedral networks
- Restrained double Roman domination of a graph
- Computing and Combinatorics
- Complete rotations in Cayley graphs
- \(k\)-power domination in block graphs
This page was built for publication: 2-power domination number for Knödel graphs and its application in communication networks
