On the power graph of a monogenic semigroup.

Autor: Khanra, Biswaranjan, Mandal, Manasi, Ghosh, Buddha Dev
Předmět:
Zdroj: Discrete Mathematics, Algorithms & Applications; Feb2024, Vol. 16 Issue 2, p1-14, 14p
Abstrakt: Let S M = { 0 , x , x 2 , ... , x n } be a monogenic semigroup with zero. Here, we consider the power graph ( M) over M with vertex set M ∗ = M \ { 0 } and two distinct vertices x i and x j are adjacent if i divides j or j divides i , where 1 ≤ i , j ≤ n. We compute various graph parameters of ( M) and topological indices based on distance of vertices. Finally, we compute some graph parameters of the cartesian product ( M 1) □ ( M 2) of graphs ( M 1) and ( M 2). [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index