56 citations · 156 across the 13 of their papers we have counts for
Showing 2012 · cs.DMShow all
2 papers · 2 filters
cs.DM2012
The total irregularity of a graph
Hosam Abdo, Darko Dimitrov
In this note a new measure of irregularity of a simple undirected graph is introduced. It is named the total irregularity of a graph and is defined as $\irr_t(G) = 1/2\sum_{u,v…
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 …