3 citations · 6 across the 8 of their papers we have counts for
7 papers · 1 filter
Burning Graph Powers and Branching Trees
Jesper Jansson, Shashanka Kulamarva, Yukihiro Murakami +1
Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned…
Acyclic Edge Coloring of 3-sparse Graphs
Nevil Anto, Manu Basavaraju, Shashanka Kulamarva
A proper edge coloring of a graph without any bichromatic cycles is said to be an acyclic edge coloring of the graph. The acyclic chromatic index of a graph denoted by ,…
Graph Burning: Bounds and Hardness
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
Graph burning is a discrete-time process that models the propagation of information in a network. Given an undirected graph whose vertices are initially unburned, the process evolv…
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…
Spanning caterpillar in biconvex bipartite graphs
Dhanyamol Antony, Anita Das, Shirish Gosavi +2
A bipartite graph is said to be a biconvex bipartite graph if there exist orderings in and in such that the neighbors of every vertex in are c…
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…