Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
From MaRDI portal
Publication:5075513
DOI10.3233/FI-222108MaRDI QIDQ5075513
C. García Gómez, Abel Cabrera Martínez, Juan Alberto Rodríguez-Velázquez
Publication date: 16 May 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.02023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the roman domination in the lexicographic product of graphs
- Perfect domination sets in Cayley graphs
- Double domination in lexicographic product graphs
- Relations between packing and covering numbers of a tree
- Roman domination in graphs.
- Perfect Roman domination in trees
- A characterization of perfect Roman trees
- From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs
- Note on the perfect Roman domination number of graphs
- On perfect Roman domination number in trees: complexity and bounds
- Perfect Roman domination in graphs
- Total Roman domination in the lexicographic product of graphs
- On the super domination number of lexicographic product graphs
- On the weak Roman domination number of lexicographic product graphs
- Rainbow domination in the lexicographic product of graphs
- Associative graph products and their independence, domination and coloring numbers
- Open k-monopolies in graphs: complexity and related concepts
- Closed formulas for the total Roman domination number of lexicographic product graphs
- A Taxonomy of Perfect Domination
- Perfect roman domination in regular graphs
- Total Roman domination in graphs
- Perfect domination in regular grid graphs
This page was built for publication: Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
