Abstract
Let G be a mixed graph. The eigenvalues and eigenvectors of G are respectively defined to be those of its Laplacian matrix. If G is a simple graph, [M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak Math. J. 25 (1975), 619–633] gave a remarkable result on the structure of the eigenvectors of G corresponding to its second smallest eigenvalue (also called the algebraic connectivity of G). For G being a general mixed graph with exactly one nonsingular cycle, using Fiedler’s result, we obtain a similar result on the structure of the eigenvectors of G corresponding to its smallest eigenvalue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. B. Bapat, S. Pati: Algebraic connectivity and the characteristic set of a graph. Linear Multilinear Algebra 45 (1998), 247–273.
R. B. Bapat, J. W. Grossman, D. M. Kulkarni: Generalized matrix tree theorem for mixed graphs. Linear Multilinear Algebra 46 (1999), 299–312.
R. B. Bapat, J. W. Grossman, D. M. Kulkarni: Edge version of the matrix tree theorem for trees. Linear Multilinear Algebra 47 (2000), 217–229.
J. A. Bondy, U. S. R. Murty: Graph Theory with Applications. Elsevier, New York, 1976.
F. R. K. Chung: Spectral Graph Theory. Conference Board of the Mathematical Science, No. 92. Am. Math. Soc., Providence, 1997.
Y.-Z. Fan: On spectra integral variations of mixed graph. Linear Algebra Appl. 374 (2003), 307–316.
M. Fiedler: Algebraic connectivity of graphs. Czechoslovak Math. J. 23 (1973), 298–305.
M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math. J. 25 (1975), 619–633.
J. W. Grossman, D. M. Kulkarni, I. E. Schochetman: Algebraic graph theory without orientations. Linear Algebra Appl. 212/213 (1994), 289–308.
J. M. Guo, S. W. Tan: A relation between the matching number and the Laplacian spectrum of a graph. Linear Algebra Appl. 325 (2001), 71–74.
R. A. Horn, C. R. Johnson: Matrix Analysis. Cambridge Univ. Press, Cambridge, 1985.
S. Kirkland, S. Fallat: Perron components and algebraic connectivity for weighted graphs. Linear Multilinear Algebra 44 (1998), 131–148.
S. Kirkland, M. Neumann, B. Shader: Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra 40 (1996), 311–325.
L. S. Melnikov, V. G. Vizing: The edge chromatic number of a directed/mixed multi-graph. J. Graph Theory 31 (1999), 267–273.
R. Merris: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197/198 (1994), 143–176.
B. Mohar: Some applications of Laplacian eigenvalues of graphs. In: Graph Symmetry (G. Hahn and G. Sabidussi, eds.). Kluwer, Dordrecht, 1997, pp. 225–275.
X.-D. Zhang, J.-S. Li: The Laplacian spectrum of a mixed graph. Linear Algebra Appl. 353 (2002), 11–20.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by National Natural Science Foundation of China (10601001), Anhui Provincial Natural Science Foundation (050460102), NSF of Department of Education of Anhui province (2004kj027), the project of innovation team on basic mathematics of Anhui University, and the project of talents group construction of Anhui University.
Rights and permissions
About this article
Cite this article
Fan, YZ. On eigenvectors of mixed graphs with exactly one nonsingular cycle. Czech Math J 57, 1215–1222 (2007). https://doi.org/10.1007/s10587-007-0120-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10587-007-0120-2