A NOTE ON THE IRREGULARITY OF GRAPHS

被引:148
作者
BELL, FK
机构
[1] Department of Mathematics University of Stirling Stirling
关键词
D O I
10.1016/0024-3795(92)90004-T
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Denote by lambda(1)(G) the largest eigenvalue of a real (0, 1)-adjacency matrix of a graph G, and by dBAR(G) the mean degree of G. Collatz and Sinogowitz roposed lambda(1)(G) - dBAR(G) as a measure of irregularity of G. A second such measure is the variance of the vertex degrees of G. The most irregular graphs according to these measures are determined for certain classes of graphs, and the two measures are shown to be incompatible for some pairs of graphs.
引用
收藏
页码:45 / 54
页数:10
相关论文
共 13 条
[1]   A PROBLEM IN REARRANGEMENTS OF (0,1) MATRICES [J].
AHARONI, R .
DISCRETE MATHEMATICS, 1980, 30 (03) :191-201
[2]   GRAPHS WITH MAXIMAL NUMBER OF ADJACENT PAIRS OF EDGES [J].
AHLSWEDE, R ;
KATONA, GOH .
ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1978, 32 (1-2) :97-120
[3]   ON THE MAXIMAL INDEX OF CONNECTED GRAPHS [J].
BELL, FK .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 144 :135-151
[4]  
BRUALDI RA, 1987, LINEAR MULTILINEAR A, V22, P57
[5]  
Brualdi RA., 1986, PUBL INSTMATH BEOGRA, V39, P45
[6]  
COLLATZ L., 1957, ABH MATH SEM HAMBURG, V21, P63, DOI DOI 10.1007/BF02941924
[7]  
CVETKOVI C D., 1988, PUBL I MATH BEOGRAD, V44, P29
[8]   A TABLE OF CONNECTED GRAPHS ON 6 VERTICES [J].
CVETKOVIC, D ;
PETRIC, M .
DISCRETE MATHEMATICS, 1984, 50 (01) :37-49
[9]  
Cvetkovic D.M., 1988, RECENT RESULTS THEOR
[10]  
Cvetkovic D.M., 1980, SPECTRA GRAPHS THEOR, V87