Perfect domination ratios of Archimedean lattices
From MaRDI portal
Publication:2088708
DOI10.37236/10210zbMath1498.05215OpenAlexW4297012049MaRDI QIDQ2088708
John C. Wierman, Thomas G. Marge, Yunfan Zhao
Publication date: 6 October 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/10210
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Topics on domination
- Efficient dominating sets in Cayley graphs.
- Fault-tolerant locating-dominating sets
- Optimal \((t, r)\) broadcasts on the infinite grid
- The \(( t , r )\) broadcast domination number of some regular graphs
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- An optimal locating-dominating set in the infinite triangular grid
- Perfect codes in graphs
- Perfect codes in Cartesian products of 2-paths and infinite paths
- On the Number of Clusters in the Percolation Model
- Total Domination in Graphs
- Rainbow perfect domination in lattice graphs
- A Taxonomy of Perfect Domination
- Quasiperfect domination in triangular lattices
- Perfect domination in regular grid graphs
This page was built for publication: Perfect domination ratios of Archimedean lattices