论文信息 - Extremely Irregular Graphs - 字舞流文

Extremely Irregular Graphs

The irregularity of a graph G is defined as irr(G )= ! |d(x) ! d(y)| where d(x) is the degree of vertex x and the summation embraces all pairs of adjacent vertices of G. We characterize the graphs minimum and maximum values of irr.

Ali Reza Ashrafi | Mostafa Tavakoli | Ivan Gutman | Freydoon Rahbarnia | Madjid Mirzavaziri

[1] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph , 2001, Graphs and Discovery.

[2] Dieter Rautenbach,et al. On the irregularity of bipartite graphs , 2007, Discret. Math..

[3] Michael O. Albertson,et al. The Irregularity of a Graph , 1997, Ars Comb..

[4] G. Fath-Tabar. Old and New Zagreb Indices of Graphs , 2011 .

[5] D. Cvetkovic,et al. Variable neighborhood search for extremal graphs 3 , 2001 .

[6] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..

[7] Hosam Abdo,et al. Bounds and Computation of Irregularity of a Graph , 2012, ArXiv.

[8] Paul Erdös,et al. How to Define an Irregular Graph , 1988 .

[9] Raphael Yuster,et al. Graphs with Large Variance , 2000, Ars Comb..

[10] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees , 2003, J. Chem. Inf. Model..

[11] F. K. Bell. A note on the irregularity of graphs , 1992 .