14 citations · 34 across the 9 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2012★ 12 cited
Bounds and Computation of Irregularity of a Graph
Hosam Abdo, Nathann Cohen, Darko Dimitrov
Albertson has defined the irregularity of a simple undirected graph as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where denotes the degree of a vertex …
cs.DM2009★ 2 cited
Acyclic Edge coloring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…