3 citations · 6 across the 8 of their papers we have counts for
8 papers
An improved upper bound for the domination number of a graph
Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva
Let be a graph of order . A classical upper bound for the domination number of a graph having no isolated vertices is . However, for several f…
A Graph-Theoretic Model for a Generic Three-Jug Puzzle
Suresh Manjanath Hegde, Shashanka Kulamarva
A classic three-jug puzzle asks, given three jugs , , and with fixed maximum capacities, with jug filled with wine to its maximum capacity, whether is it possible to…
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
Nevil Anto, Manu Basavaraju, Suresh Manjanath Hegde +1
An acyclic edge coloring of a graph is a proper edge coloring without any bichromatic cycles. The acyclic chromatic index of a graph denoted by , is the minimum such…
Acyclic Chromatic Index of Chordless Graphs
Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva
An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycles. The acyclic chromatic index of a graph denoted by , is the minimu…
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…
On Clique Convergences of Graphs
S. M. Hegde, V. V. P. R. V. B. Suresh Dara
Let be a graph and be the set of all cliques of , then the clique graph of G denoted by is the graph with vertex set and two elements…