Perfect Italian domination on some generalizations of cographs
DOI10.1007/S40314-024-02901-5zbMATH Open1548.05257MaRDI QIDQ6616154
Publication date: 8 October 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
distance-hereditary graphsNP-completenessgraph algorithms\(P_4\)-sparse graphsperfect Italian dominationcomb convex bipartite graphs
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Italian domination in trees
- Clustering to minimize the maximum intercluster distance
- A tree representation for \(P_ 4\)-sparse graphs
- Perfect Italian domination in trees
- Linear time solvable optimization problems on graphs of bounded clique-width
- Algorithmic aspects of Roman domination in graphs
- Perfect Italian domination in graphs: complexity and algorithms
- Perfect Italian domination on planar and regular graphs
- On some domination colorings of graphs
- Perfect Italian domination in cographs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal Problems for Roman Domination
- Algorithmic aspects of Roman {3}-domination in graphs
This page was built for publication: Perfect Italian domination on some generalizations of cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616154)
