2 citations · 2 across the 6 of their papers we have counts for
6 papers
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…
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…
Extending some results on the second neighborhood conjecture
Suresh Dara, Mathew C. Francis, Dalu Jacob +1
A vertex in a directed graph is said to have a large second neighborhood if it has at least as many second out-neighbors as out-neighbors. The Second Neighborhood Conjecture, first…
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…
On Erdos-Faber-Lovasz Conjecture
S. M. Hegde, Suresh Dara
In 1972, Erdös - Faber - Lovász (EFL) conjectured that, if is a linear hypergraph consisting of edges of cardinality , then it is possible to color the vertices…
The Dynamics of the Forest Graph Operator
Suresh Dara, S. M. Hegde, Venkateshwarlu Deva +2
In 1966, Cummins introduced the "tree graph": the tree graph of a graph (possibly infinite) has all its spanning trees as vertices, and distinct such trees corr…