Partially composed property of generalized lexicographic product graphs
From MaRDI portal
Publication:4597965
DOI10.1142/S1793830917500793zbMath1386.05141MaRDI QIDQ4597965
Sayan Panma, Boyko Gyurov, Nopparat Pleanmani
Publication date: 14 December 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
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
- On the roman domination in the lexicographic product of graphs
- Rainbow domination in the lexicographic product of graphs
- A survey of hereditary properties of graphs
- Generalized domination, independence and irredudance in graphs
- Algebraic graph theory. Morphisms, monoids and matrices
This page was built for publication: Partially composed property of generalized lexicographic product graphs