Sajith Padinhatteeri

activity

20142024

collaborators

5 papers

math.CO2024

Gallai's Path Decomposition of Levi Graph

Akankshya Sahu, Sajith Padinhatteeri

Gallai's path decomposition conjecture states that for a connected graph $G$ on $n$ vertices, there exists a path decomposition of size $⌈ \frac{n}{2} ⌉$ . The Levi graph…

cs.DS2022

s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri +1

In this paper, we study the computational complexity of \textsc{ $s$ -Club Cluster Vertex Deletion}. Given a graph, \textsc{ $s$ -Club Cluster Vertex Deletion ( $s$ -CVD)} aims to delete…

math.CO2017

Vertex transitive graphs $G$ with $χ_{D} (G) > χ (G)$ and small automorphism group

Niranjan Balachandran, Sajith Padinhatteeri, Pablo Spiga

For a graph $G$ and a positive integer $k$ , a vertex labelling $f : V (G) \to {1, 2 \dots, k}$ is said to be $k$ -distinguishing if no non-trivial automorphism of $G$ preserves the sets…

math.CO2016

The List Distinguishing Number of Kneser Graphs

Niranjan Balachandran, Sajith Padinhatteeri

A graph $G$ is said to be $k$ -distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishin…

math.CO2014

Distinguishing Chromatic Number of Random Cayley graphs