On the index of bicyclic graphs with perfect matchings

Discrete Mathematics

Volumn 283, Issue 1-3, 2004, Pages 51-59

  Chang, An ^a   Tian, Feng ^b   Yu, Aimei ^b  

^a FUZHOU UNIVERSITY   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Bicyclic graphs; Index; Perfect matching; Upper bound

Indexed keywords

ASYMPTOTIC STABILITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING;

BICYCLE GRAPHS; INDEX; PERFECT MATCHING; UPPER BOUND;

GRAPH THEORY;

EID: 2442698080     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.02.005     Document Type: Article

References (16)

1. Bell F.K. On the maximal index of connected graphs. Linear Algebra Appl. 144:1993;135-151.
2. Brualdi R.A., Solheid E.S. On the spectral radius of connected graphs. Publ. Inst. Math. (Beograd). 39(53):1986;45-54.
3. Chang A., Tian F. On the spectral radius of unicyclic graphs with perfect matchings. Linear Algebra Appl. 370:2003;237-250.
4. Collatz L., Sinogowitz U. Spektren endlicher grapen. Abh. Math. Sem. Univ. Hamburg. 21:1957;63-77.
5. A.J. Hoffman, J.H. Smith, On the spectral radii of topologically equivalent graphs, in: Fiedler (Ed.), Recent advances in graph theory, Academia Praha, New York, 1975, pp. 273-281.
6. Hou Y.P., Li J.S. Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra Appl. 342:2002;203-217.
7. Cvetković D., Doob M., Sachs H. Spectra of Graph - Theory and Applications. 1980;Academic Press, New York.
8. Cvetković D., Petrić M. A table of connected graphs on six vertices. Discrete Math. 50(1):1984;37-49.
9. Cvetković D., Rowlinson P. On the connected graphs with maximal index. Publ. Inst. Math. (Beograd). 44(58):1986;29-34.
10. Cvetković D., Rowlinson P. The largest eigenvalue of graphs. a survey Linear Multilinear Algebra. 28:1990;3-33.
11. Cvetković D., Rowlinson P., Simić S. Eigenspaces of Graphs. 1997;Cambridge University Press, Cambridge.
12. Lovász L., Pelikan J. On the eigenvalues of trees. Periodica Math. Hung. 3:1973;175-182.
13. Schwenk A.J. Computing the characteristic polynomial of a graph. Bari R.A., Harary F. Graphs and Combinatorics. Lecture Notes in Mathematics. Vol. 406:1974;153-173 Springer, New York.
14. Simić S. On the largest eigenvalue of unicyclic graphs. Publ. Inst. Math. (Beograd). 42(56):1987;13-19.
15. Simić S. On the largest eigenvalue of bicyclic graphs. Publ. Inst. Math. (Beograd). 46(60):1989;101-106.
16. G.H. Xu, On the spectral radius of trees with perfect matchings, in: Combinatorics and Graph Theory, World Scientific, Singapore, 1997.