Line graphs of monogenic semigroup graphs (Q2035709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7363434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Line graphs of monogenic semigroup graphs |
scientific article; zbMATH DE number 7363434 |
Statements
Line graphs of monogenic semigroup graphs (English)
0 references
25 June 2021
0 references
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))\).
0 references
0 references
0.8651644587516785
0 references
0.8572981357574463
0 references
0.8290978074073792
0 references
0.823103666305542
0 references
0.8083191514015198
0 references
