s-Shunt Intersection Graph of a Graph
Abstract
The intersection graph of a family of sets \S1,S2,…,Sn\ is a graph whose vertex set is \S1,S2,…,Sn\ 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 s-shunt intersection graph, generated from the s-arcs of a given graph is initiated in this paper.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.