Line graphs of monogenic semigroup graphs
Summary: The concept of monogenic semigroup graphs \(\Gamma (\mathcal{S}_M)\) is firstly introduced by \textit{K. Ch. Das} et al. [J. Inequal. Appl. 2013, Paper No. 44, 13 p. (2013; Zbl 1283.05067)] based on zero divisor graphs. In this study, we mainly discuss the some graph properties over the line graph \(L (\Gamma (\mathcal{S}_M))\) of \(\Gamma (\mathcal{S}_M)\). In detail, we prove the existence of graph parameters, namely, radius, diameter, girth, maximum degree, minimum degree, chromatic number, clique number, and domination number over \(L (\Gamma (\mathcal{S}_M))\).
- On a graph of monogenic semigroups
- A further note on the graph of monogenic semigroups
- Some properties on the disjunctive product over graphs of monogenic semigroups
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups
- On the corona product of monogenic semigroup graphs
- A new bound of radius with irregularity index
- Beck's coloring of a commutative ring
- Coloring of commutative rings
- Handbook of Graph Theory
- scientific article; zbMATH DE number 3102314 (Why is no real title available?)
- Normal hypergraphs and the perfect graph conjecture
- On a graph of monogenic semigroups
- On the Zagreb indices of the line graphs of the subdivision graphs
- On the Zero-Divisor Graph of a Ring
- Radius, diameter, and minimum degree
- Some properties of line digraphs
- Some properties on the lexicographic product of graphs obtained by monogenic semigroups
- The zero-divisor graph of a commutative ring
- The zero-divisor graph of a commutative semigroup
- Topological indices of the line graph of subdivision graphs and their Schur-bounds
- Zero divisor graphs of semigroups.
This page was built for publication: Line graphs of monogenic semigroup graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035709)
