$s$-Shunt Intersection Graph of a Graph
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916855869865984 |
|---|---|
| author | Prebhath, Vinny Susan Naduvath, Sudev |
| author_facet | Prebhath, Vinny Susan Naduvath, Sudev |
| contents | The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16309 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | $s$-Shunt Intersection Graph of a Graph Prebhath, Vinny Susan Naduvath, Sudev Combinatorics 05C62 The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ 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. |
| title | $s$-Shunt Intersection Graph of a Graph |
| topic | Combinatorics 05C62 |
| url | https://arxiv.org/abs/2507.16309 |