Aryan Sanghi

collaborators

2 papers

math.CO2026

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs

Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay

Given a simple graph $G$ , its line graph, denoted by $L (G)$ , is obtained by representing each edge of $G$ as a vertex, with two vertices in $L (G)$ adjacent whenever the correspondi…

math.CO2024

Forbidden induced subgraphs in iterative higher order line graphs

Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal

Let $G$ be a simple finite connected graph. The line graph $L (G)$ of graph $G$ is the graph whose vertices are the edges of $G$ , where $e f \in E (L (G))$ when $e \cap f \neq \emptyse…