Protection of lexicographic product graphs
From MaRDI portal
Publication:2062678
DOI10.7151/dmgt.2243zbMath1482.05254OpenAlexW2981008656WikidataQ127010765 ScholiaQ127010765MaRDI QIDQ2062678
Juan Alberto Rodríguez-Velázquez, Douglas J. Klein
Publication date: 3 January 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2243
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items
From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product 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
- On the roman domination in the lexicographic product of graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- On secure domination in 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
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Vertex Covers and Secure Domination in Graphs
- Secure domination and secure total domination in graphs
- Total domination in graphs
- Domination in planar graphs with small diameter*
- Total Domination in Graphs
- Protection of graphs with emphasis on Cartesian product graphs
