11 citations · 27 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 5 cited
Total Colourings - A survey
Geetha Jayabalan, Narayanan N, K Somasundaram
The smallest integer needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vi…
math.AC2018
An upper bound for the regularity of binomial edge ideals of trees
A. V. Jayanthan, N. Narayanan, B. V. Raghavendra Rao
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
cs.DM2018
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…