Some properties on the lexicographic product of graphs obtained by monogenic semigroups
DOI10.1186/1029-242X-2013-238zbMath1282.05032WikidataQ59300415 ScholiaQ59300415MaRDI QIDQ2637547
Kinkar Chandra Das, Ismail Naci Cangul, Nihat Akgüneş, Ahmet Sinan Cevik
Publication date: 12 February 2014
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
independence numberchromatic numberclique numberdomination numbermonogenic semigrouplexicographic product
Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Cites Work
- A new bound of radius with irregularity index
- Some results on the lexicographic product of vertex-transitive graphs
- Coloring of commutative rings
- Radius, diameter, and minimum degree
- The zero-divisor graph of a commutative ring
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Factoring cardinal product graphs in polynomial time
- Zero divisor graphs of semigroups.
- The zero-divisor graph of a commutative semigroup
- Coloring graph products---a survey
- Normal hypergraphs and the perfect graph conjecture
- On the Zero-Divisor Graph of a Ring
This page was built for publication: Some properties on the lexicographic product of graphs obtained by monogenic semigroups