2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2021
Strong edge coloring of Cayley graphs and some product graphs
Suresh Dara, Suchismita Mishra, Narayanan Narayanan +1
A strong edge coloring of a graph is a proper edge coloring of such that every color class is an induced matching. The minimum number of colors required is termed the stron…
math.CO2019★ 2 cited
Some results on domination number of the graph defined by two levels of the n-cube
Yeshwant Pandit, S. L. Sravanthi, Suresh Dara +1
Let and where denote the family of all -element subsets and -element subsets of respectively. D…
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 regular linear hypergraphs o…