Limit points of eigenvalues of (di)graphs

Fu Ji Zhang; Zhibo Chen

Czechoslovak Mathematical Journal (2006)

  • Volume: 56, Issue: 3, page 895-902
  • ISSN: 0011-4642

Abstract

top
The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph D , the set of limit points of eigenvalues of iterated subdivision digraphs of D is the unit circle in the complex plane if and only if D has a directed cycle. 3. Every limit point of eigenvalues of a set 𝒟 of digraphs (graphs) is a limit point of eigenvalues of a set 𝒟 ¨ of bipartite digraphs (graphs), where 𝒟 ¨ consists of the double covers of the members in 𝒟 . 4. Every limit point of eigenvalues of a set 𝒟 of digraphs is a limit point of eigenvalues of line digraphs of the digraphs in 𝒟 . 5. If M is a limit point of the largest eigenvalues of graphs, then - M is a limit point of the smallest eigenvalues of graphs.

How to cite

top

Zhang, Fu Ji, and Chen, Zhibo. "Limit points of eigenvalues of (di)graphs." Czechoslovak Mathematical Journal 56.3 (2006): 895-902. <http://eudml.org/doc/31075>.

@article{Zhang2006,
abstract = {The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph $D$, the set of limit points of eigenvalues of iterated subdivision digraphs of $D$ is the unit circle in the complex plane if and only if $D$ has a directed cycle. 3. Every limit point of eigenvalues of a set $\mathcal \{D\}$ of digraphs (graphs) is a limit point of eigenvalues of a set $\ddot\{\mathcal \{D\}\}$ of bipartite digraphs (graphs), where $\ddot\{\mathcal \{D\}\}$ consists of the double covers of the members in $\mathcal \{D\}$. 4. Every limit point of eigenvalues of a set $\mathcal \{D\}$ of digraphs is a limit point of eigenvalues of line digraphs of the digraphs in $\mathcal \{D\}$. 5. If $M$ is a limit point of the largest eigenvalues of graphs, then $-M$ is a limit point of the smallest eigenvalues of graphs.},
author = {Zhang, Fu Ji, Chen, Zhibo},
journal = {Czechoslovak Mathematical Journal},
keywords = {limit point; eigenvalue of digraph (graph); double cover; subdivision digraph; line digraph; limit point; eigenvalue of digraph (graph); double cover; subdivision digraph; line digraph},
language = {eng},
number = {3},
pages = {895-902},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Limit points of eigenvalues of (di)graphs},
url = {http://eudml.org/doc/31075},
volume = {56},
year = {2006},
}

TY - JOUR
AU - Zhang, Fu Ji
AU - Chen, Zhibo
TI - Limit points of eigenvalues of (di)graphs
JO - Czechoslovak Mathematical Journal
PY - 2006
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 56
IS - 3
SP - 895
EP - 902
AB - The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph $D$, the set of limit points of eigenvalues of iterated subdivision digraphs of $D$ is the unit circle in the complex plane if and only if $D$ has a directed cycle. 3. Every limit point of eigenvalues of a set $\mathcal {D}$ of digraphs (graphs) is a limit point of eigenvalues of a set $\ddot{\mathcal {D}}$ of bipartite digraphs (graphs), where $\ddot{\mathcal {D}}$ consists of the double covers of the members in $\mathcal {D}$. 4. Every limit point of eigenvalues of a set $\mathcal {D}$ of digraphs is a limit point of eigenvalues of line digraphs of the digraphs in $\mathcal {D}$. 5. If $M$ is a limit point of the largest eigenvalues of graphs, then $-M$ is a limit point of the smallest eigenvalues of graphs.
LA - eng
KW - limit point; eigenvalue of digraph (graph); double cover; subdivision digraph; line digraph; limit point; eigenvalue of digraph (graph); double cover; subdivision digraph; line digraph
UR - http://eudml.org/doc/31075
ER -

References

top
  1. Graph Theory with Applications, Macmilliam, London, 1976. (1976) MR0411988
  2. 10.1002/jgt.3190170307, J.  Graph Theory 17 (1993), 325–331. (1993) MR1220993DOI10.1002/jgt.3190170307
  3. 10.1016/0024-3795(93)00135-M, Linear Algebra Appl. 216 (1995), 211–224. (1995) MR1319986DOI10.1016/0024-3795(93)00135-M
  4. Spectra of Graphs, Academic Press, New York, 1980, third edition Johann Ambrosius Barth Verlag 1995. (1980) MR0572262
  5. The largest eigenvalue of a graph: a survey, Linear and multilinear Algebra 28 (1990), 3–33. (1990) MR1077731
  6. The limit points of eigenvalues of graphs, Linear Algebra Appl. 114/115 (1989), 659–662. (1989) Zbl0671.05050MR0986899
  7. Some new results on the limit points of eigenvalues of graphs, Abstracts Amer. Math. Soc. 12 (1991), 450. (1991) 
  8. 10.1007/BF02854581, Rend. Circ. Mat. Palermo 9 (1960), 161–168. (1960) MR0130839DOI10.1007/BF02854581
  9. On limit points of spectral radii of non-negative symmetric integral matrices, Graph Theory and its Application. Lecture Notes in Math.  303, Y. Alavi et al. (eds.), Springer-Verlag, New York, 1972, pp. 165–172. (1972) Zbl0297.15016MR0347860
  10. On limit points of the least eigenvalue of a graph, Ars Combinatoria 3 (1977), 3–14. (1977) Zbl0445.05067MR0498274
  11. Theory of Matrices, Vol.  I, AMS Chelsea Publishing, Providence, 1960. (1960) 
  12. On the characteristic polynomial of directed line graph and a type of cospectral directed digraph, KeXue TongBao (Chinese Sci. Bulletin) 22 (1983), 1348–1350. (1983) MR0740127
  13. Matrices in Combinatorics and Graph Theory, Kluwer, Dordrecht, 2000. (2000) 
  14. A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, 1964. (1964) MR0162808
  15. On the distribution of the maximum eigenvalue of graphs, Linear Algebra and Appl. 114/115 (1989), 17–20. (1989) MR0986863
  16. The characteristic polynomials of digraphs formed by some unary operations, J.  Xinjiang Univ. 4 (1987), 1–6. (1987) MR0924475

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.