G. Arunkumar

activity

20172020

most citedGeneralized chromatic polynomials of graphs from Heaps of pieces

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2020★ 1 cited

A generalization of Fiedler's lemma and the spectra of H-join of graphs

M. Saravanan, S. P. Murugan, G. Arunkumar

A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join, the spectra o…

math.CO2019★ 2 cited

Generalized chromatic polynomials of graphs from Heaps of pieces

G Arunkumar

Let $G$ be a simple graph and let $L (G)$ be the free partially commutative Lie algebra associated to $G$ . In this paper, using heaps of pieces, we prove an expression for…

math.CO2017

The Peterson recurrence formula for the chromatic discriminant of a graph

G. Arunkumar

The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $α (G)$ . There is a well known r…