Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Prebhath, Vinny Susan; Naduvath, Sudev Title A name given to the resource The s-shunt non-intersection graph of a graph Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2650029; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830926500291" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830926500291</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105033394833?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105033394833?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Prebhath V.S., Department of Mathematics, Christ University, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Christ University, Bangalore, India Description An account of the resource 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. Subject The topic of the resource Intersection graphs; s-arcs; s-shunt non-intersection graph Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online