The sharpness of a lower bound on the algebraic connectivity for maximal graphs

References

• Bauer , F. L. , Eckart , Deutsch and Stoer , J. 1969 . Abschätzungen für die eigenwerte positive linearer Operatoren . Linear Algebra and its Applications , 2 : 275 – 301 .
   Google Scholar
• Berman , A. and Plemmons , R. J. 1994 . Nonnegative Matrices in the Mathematical Sciences . SIAM , 2
   Google Scholar
• Chebotarev , P. Yu. and Shamis , E. V. 1988 . Newblock On proximity measures for graph vertices . Automation and Remote Control , 59 : 1433 – 1459 .
   Google Scholar
• Chartrand , G. and Oellermann , O. R. 1993 . Applied and Algorithmic Graph Theory , New York : McGraw-Hill, Inc. .
   Google Scholar
• Eckart , Deutsch and Zenger , C. 1971 . Inclusion domains for eigenvalues of stochastic matrices . Numerische Mathematik , 18 : 182 – 192 .
   Google Scholar
• Fiedler , M. 1973 . Algebraic connectivity of graphs . Czechoslovak Mathematical Journal , 23 : 298 – 305 .
   Web of Science ®Google Scholar
• Kirkland , S. and Shader , B. 1997 . Distances in weighted trees and group inverse of laplacian Matrices . SIAM Journal of Matrix Analysis Applications , 18 : 827 – 841 .
   Web of Science ®Google Scholar
• Kirkland , S. J. , Neumann , M. and Shader , B. 1998 . Bounds on the subdominant eigenvalue involving group inverses with applications to graphs . Czechoslovak Mathematical Journal , 47 : 1 – 20 .
   Google Scholar
• Kirkland , S. J. and Shader , B. 1998 . On a bound on algebraic connectivity: the case of equality . Czechoslovak Mathematical Journal , 48 : 65 – 76 .
   Google Scholar
• Kühne , R. and Rhodius , A. 1990 . A characterization of dobrushin's coefficient of ergodicity . Z. Anal. Anw. , 9 ( 2 ) : 187 – 188 .
   Google Scholar
• Merris , R. 1994 . Degree maximal graphs are laplacian integral . Linear Algebra and its Applications , 199 ( 2 ) : 381 – 389 .
   Google Scholar
• Merris , R. 1997 . Doubly stochastic graph matrices . Univ. Beogradu Pub. Elektrotehn. Fak., Seria Matematyka , 8 ( 2 ) : 64 – 71 .
   Google Scholar
• Meyer , C. D. 1975 . The role of the group generalized inverse in the theory of finite Markov chains . SIAM Rev. , 17 ( 2 ) : 443 – 464 . Jr.
   Google Scholar
• Meyer , C. D. and Stadelmaier , M. W. 1978 . Singular M-matrices and inverse poistivity . Linear Algebra and its Applications , 22 ( 2 ) : 139 – 156 .
   Google Scholar
• Molitierno , J. J. , Neumann , M. and Shader , B. 2000 . Tight bounds on the algebraic connectivity of a balanced binary tree . ELA (Electronic Linear Algebra Journal) , 6 ( 2 ) : 62 – 71 .
   Google Scholar
• Paige , C. C. , Styan , G. P. H. and Wachter , P. G. 1975 . Computation of the stationary distribution of Markov chains . Journal of Statistical Computation and Simulation , 4 ( 2 ) : 173 – 186 .
   Google Scholar
• Paz , A. 1971 . Introduction to Probabilistic Automata , New York : Academic Press .
   Google Scholar
• Rothblum , U. G. 1985 . A representation of the drazin inverse and characterizations of the index . SIAM Journal Applied Mathematics , 31 : 646 – 648 .
   Google Scholar
• Rothblum , U. G. and Tan , C. P. 1985 . Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices . Linear Algebra and its Applications , 66 : 45 – 86 .
   Web of Science ®Google Scholar
• Ruch , E. and Gutman , I. 1979 . The branching extent of graphs . Journal Combinatorics, Information & System Sciences , 4 : 285 – 295 .
   Google Scholar
• Seneta , E. 1981 . Non-negative Matrices and Markov Chains , New York : Springer-Verlag . Second edition
   Google Scholar
• Sierksma , G. and Hoogeveen , H. 1991 . Seven criteria for integer sequences being graphic . Journal of Graph Theory , 15 : 223 – 231 .
   Google Scholar