On Line Graph Associated with a Non-Commuting Graph for Finite Rings

##plugins.themes.bootstrap3.article.main##

Natwalan Ruk-u
Khajee Jantarakhajorn
Borworn Khuhirun

摘要

Let R be a non-commutative ring. A non-commuting graph of R, denoted by ΓR, is a simple graph with a vertex set consisting of elements in R, except for its center. Any two distinct vertices x and y are adjacent if xygif.latex?\neqyx. A line graph associated with ΓR, denoted by LR), is a simple graph in which each vertex of LR) represents an edge of ΓR, and two distinct vertices of LR) are adjacent if their corresponding edges share a common endpoint in ΓR. This paper provides bounds for seven graph parameters of LR): minimum degree, maximum degree, order, size, diameter, vertex-connectivity and edge-connectivity. Additionally, we show that the girth of LR) is exactly 3.

##plugins.themes.bootstrap3.article.details##

栏目
Physical sciences