Matchings in starlike trees

Applied Mathematics Letters

Volumn 14, Issue 7, 2001, Pages 843-848

  Gutman, I ^a   Araujo, O ^b   Rada, J ^b  

^a UNIVERSITY OF KRAGUJEVAC   (Serbia)

^b UNIVERSIDAD DE LOS ANDES   (Venezuela)

Author keywords

Extremal graphs; Matchings; Ordering (of graphs); Starlike trees

Indexed keywords

EID: 0035480015     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(01)00054-4     Document Type: Article

References (9)

1. Gutman I. Partial ordering of forests according to their characteristic polynomials. Hajnal A., Sós V.T. Combinatorics. 1978;429-436 North Holland, Amsterdam.
2. Gutman I. Graphs with greatest number of matchings. Publ. Inst. Math. (Beograd). 27:1980;67-76.
3. Gutman I., Cvetković D. Finding tricyclic graphs with maximal number of matchings - Another example of computer aided research in graph theory. Publ. Inst. Math. (Beograd). 35:1984;33-40.
4. Gutman I., Zhang F. On the ordering of graphs with respect to their matching numbers. Discrete Appl. Math. 15:1986;25-33.
5. Gutman I. Acyclic systems with extremal Hückel π-electron energy. Theor. Chim. Acta. 45:1977;79-87.
6. Li H. On minimal energy ordering of acyclic conjugated molecules. J. Math. Chem. 25:1999;145-169.
7. Zhang F., Li H. On acyclic conjugated molecules with minimal energies. Discrete Appl. Math. 92:1999;71-84.
8. Farrell E.J. An introduction to matching polynomials. J. Comb. Theory B. 27:1979;75-86.
9. Godsil C.D., Gutman I. On the theory of the matching polynomial. J. Graph Theory. 5:1981;137-144.