$s$-Shunt Intersection Graph of a Graph
Combinatorics
2025-07-23 v1
Abstract
The intersection graph of a family of sets is a graph whose vertex set is and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty. Different types of intersection graphs have been studied depending on the nature of sets taken as the vertex set. A study on a particular type of intersection graph called -shunt intersection graph, generated from the -arcs of a given graph is initiated in this paper.
Cite
@article{arxiv.2507.16309,
title = {$s$-Shunt Intersection Graph of a Graph},
author = {Vinny Susan Prebhath and Sudev Naduvath},
journal= {arXiv preprint arXiv:2507.16309},
year = {2025}
}