The s-shunt non-intersection graph of a graph
Intersection graphs; s-arcs; s-shunt non-intersection graph
For an integer s ? 1, an s ? arc in a graph G is a sequence of (s + 1) vertices (v1,v2,,vs,vs+1) of G such that for all 1 ? i ? s, vi ? vi+1, and for all 1 ? i ? s ? 1, vi?vi+2. A non-intersection graph of the set of all s-arcs on distinct vertices of G, that can be shunted onto some other s-arc on distinct vertices of G, has been introduced. Basic properties based on the order, size and the degree of an arbitrary vertex of the non-intersection graph of a graph defined are obtained. Additionally, certain properties pertaining to the connectedness of the same are discussed. 2026 World Scientific Publishing Company.
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2650029;
Restricted Access; Hardcopy may be available in the library
https://doi.org/10.1142/S1793830926500291 https://www.scopus.com/pages/publications/105033394833?origin=resultslist
Prebhath V.S., Department of Mathematics, Christ University, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Christ University, Bangalore, India