Doubly stochastic graph matrices, II

Linear and Multilinear Algebra

Volumn 45, Issue 2-3, 1998, Pages 275-285

  Merris, Russell ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Algebraic connectivity; Degree antiregular graph; Diameter; Distance; Eigenvalue; Laplacian matrix; Wiener index

Indexed keywords

EID: 0040946858     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: 10.1080/03081089808818591     Document Type: Article

References (8)

1. Chan, O., Gutman, I., Lam, T. K. and Merris, R. (1998). Algebraic connections between topological indices, J. Chem. Inf. Comp. Sci., 38, 62-65.
2. Chebotarev, P. Yu. and Shamis, E. V. (1997). The matrix-forest theorem and measuring relations in small social groups, Automation and Remote Control, 58, 1505-1514.
3. Golender, V. E., Drboglav, V. V. and Rosenblit, A. B. (1981). Graph potentials method and its application for chemical information processing, J. Chem Inf. Comput. Sci., 21, 126-204.
4. Horn, R. A. and Johnson, C. R. (1985). Matrix Analysis, Cambridge Univ. Press.
5. Ledermann, W. (1973). On the latent roots of a doubly stochastic matrix, J. Australian Math. Soc., 16, 353-356.
6. The MATH WORKS Inc., The Student Edition of MATLAB™, Prentice Hall, Englewood Cliffs, 1992.
7. Merris, R. (1994). Degree maximal graphs are Laplacian integral, Linear Algebra Appl., 199, 381-389.
8. Merris, R. (1997). Doubly stochastic graph matrices, Univ. Beograd. Publ. Elektrotehn. Fak. (Ser. Mat.) 8, 64-71.