Partially composed property of generalized lexicographic product graphs
From MaRDI portal
Publication:4597965
DOI10.1142/S1793830917500793zbMATH Open1386.05141MaRDI QIDQ4597965FDOQ4597965
Authors: Nopparat Pleanmani, Boyko Gyurov, S. Panma
Publication date: 14 December 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
- Connectivity and other invariants of generalized products of graphs
- scientific article; zbMATH DE number 1558219
- Domination related parameters in the generalized lexicographic product of graphs
- scientific article; zbMATH DE number 2192204
- Total \([1,k]\)-sets of lexicographic product graphs with characterization
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow domination in the lexicographic product of graphs
- Title not available (Why is that?)
- A survey of hereditary properties of graphs
- Algebraic graph theory. Morphisms, monoids and matrices
- Title not available (Why is that?)
- On the roman domination in the lexicographic product of graphs
- Generalized domination, independence and irredudance in graphs
Cited In (2)
This page was built for publication: Partially composed property of generalized lexicographic product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597965)