S. M. Hegde

collaborators

2 papers

math.CO2024

An improved upper bound for the domination number of a graph

Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva

Let $G$ be a graph of order $n$ . A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $⌊ \frac{n}{2} ⌋$ . However, for several f…

math.CO2018

Bounds on Erd{ő}s - Faber - Lovász Conjecture - the Uniform and Regular Cases

S. M. Hegde, Suresh Dara

We consider the Erd{ő}s - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of $r$ regular linear hypergraphs $H$ o…