From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
DOI10.1007/s40840-023-01502-5zbMath1512.05319OpenAlexW4366588926MaRDI QIDQ6102213
Luis Pedro Montejano, Abel Cabrera Martínez, Juan Alberto Rodríguez-Velázquez
Publication date: 8 May 2023
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-023-01502-5
2-dominationdouble domination\(w\)-dominationlexicographic product graphquasi-total Italian dominationtotal Italian domination
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- On the roman domination in the lexicographic product of graphs
- \(k\)-tuple total domination in graphs
- Double domination in lexicographic product graphs
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- Protection of lexicographic product graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- Total protection of lexicographic product graphs
- From (secure) \(w\)-domination in graphs to protection of lexicographic product 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
- Closed formulas for the total Roman domination number of lexicographic product graphs
- Total Roman {2}-domination in graphs
- From Italian domination in lexicographic product graphs to w-domination in graphs
This page was built for publication: From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
