Graphs that are simultaneously efficient open domination and efficient closed domination graphs
From MaRDI portal
Publication:516892
DOI10.1016/j.dam.2016.09.027zbMath1358.05221arXiv1511.01916OpenAlexW2964079446MaRDI QIDQ516892
Iztok Peterin, Sandi Klavžar, Ismael González Yero
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01916
computational complexityperfect codeSierpiński graphefficient open dominationefficient closed domination
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (9)
Graphs with unique maximum packing of closed neighborhoods ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ (Open) packing number of some graph products ⋮ Efficient closed domination in digraph products ⋮ \([1,k\)-domination number of lexicographic products of graphs] ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ On domination game stable graphs and domination game edge-critical graphs ⋮ On the 2-packing differential of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global strong defensive alliances of Sierpiński-like graphs
- Tight-optimal circulants vis-à-vis twisted tori
- Efficient dominating sets in circulant graphs with domination number prime
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Efficient domination in cubic vertex-transitive graphs
- Efficient open domination in Cayley graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- On perfect codes in Cartesian products of graphs
- Shortest paths in Sierpiński graphs
- An almost complete description of perfect codes in direct products of cycles
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes over graphs
- Error-correcting codes on the Towers of Hanoi graphs
- Structural properties of subdivided-line graphs
- Generalized power domination: propagation radius and Sierpiński graphs
- Perfect codes in direct graph bundles
- New results on variants of covering codes in Sierpiński graphs
- Construction of trees and graphs with equal domination parameters
- Perfect codes in graphs
- Odd neighborhood transversals on grid graphs
- Open k-monopolies in graphs: complexity and related concepts
- Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
- 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
- Vizing's conjecture: a survey and recent results
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Total Domination in Graphs
- Perfect domination in regular grid graphs
This page was built for publication: Graphs that are simultaneously efficient open domination and efficient closed domination graphs
