Abstract

Let N be a near-ring and I be an ideal of N. The graph of N with respect to I is a graph with V (N ) as vertex set and any two distinct vertices x and y are adjacent if and only if xNy ⊆ I oryNx ⊆ I. This graph is denoted by GI(N). We define the line graph of GI(N) as a graph with each edge of GI (N ) as vertex and any two distinct vertices are adjacent if and only if their corresponding edges share a common vertex in the graph GI (N ). We denote this graph by L(GI (N )). We have discussed the diameter, girth, clique number, dominating set of L(GI(N)). We have also found conditions for the graph L(GI(N)) to be acycle graph.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.