Degree Distance of Unicyclic Graphs with Given Matching Number

Graphs and Combinatorics

Volumn 29, Issue 3, 2013, Pages 449-462

  Feng, Lihua ^a,b   Liu, Weijun ^b   Ilić, Aleksandar ^c   Yu, Guihai ^a  

^a SHANDONG INSTITUTE OF BUSINESS AND TECHNOLOGY   (China)

^b CENTRAL SOUTH UNIVERSITY   (China)

^c UNIVERSITY OF NI   (Serbia)

Author keywords

Degree distance; Matching number; Unicyclic graph; Wiener index

Indexed keywords

EID: 84877329219     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-012-1143-5     Document Type: Article

References (22)

1. Bondy J. A., Murty U. S. R.: Graph Theory with Applications. Macmillan Press, New York (1976).
2. Bucicovschi O., Cioabǎ S. M.: The minimum degree distance of graphs of given order and size. Discret. Appl. Math. 156, 3518-3521 (2008).
3. Chang A., Tian F.: On the spectral radius of unicyclic graphs with perfect matching. Linear Algebra Appl. 370, 237-250 (2003).
4. Dankelmann P., Gutman I., Mukwembi S., Swart H. C.: On the degree distance of a graph. Discret. Appl. Math. 157, 2773-2777 (2009).
5. Diudea M. V., Gutman I., Jäntschi L.: Molecular Topology. Nova, Huntington (2001).
6. Dobrynin A., Entringer R., Gutman I.: Wiener index of trees: theory and applications. Acta Appl. Math. 66, 211-249 (2001).
7. Dobrynin A. A., Kochetova A. A.: Degree distance of a graph: a degree analogue of the Wiener index. J. Chem. Inf. Comput. Sci. 34, 1082-1086 (1994).
8. Du Z., Zhou B.: Minimum Wiener indices of trees and unicyclic graphs of given matching number. MATCH Commun. Math. Comput. Chem. 63, 101-112 (2010).
9. Gutman I.: Selected properties of the Schultz molecular topological index. J. Chem. Inf. Comput. Sci. 34, 1087-1089 (1994).
10. Gutman I., Polansky O. E.: Mathematical Concepts in Organic Chemistry. Springer, Berlin (1986).
11. Hou Y. P., Li J. S.: Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra Appl. 342, 203-217 (2002).
12. Ilić A., Stevanović D., Feng L., Yu G., Dankelmann P.: Degree distance of unicyclic and bicyclic graphs. Discret. Appl. Math. 159, 779-788 (2011).
13. Ilić A., Klavžar S., Stevanović D.: Calculating the degree distance of partial Hamming graphs. MATCH Commun. Math. Comput. Chem. 63, 411-424 (2010).
14. Ilić A.: Trees with minimal Laplacian coefficients. Comp. Math. Appl. 59, 2776-2783 (2010).
15. McKay, B.: Nauty http://cs. anu. edu. au/~bdm/nauty/.
16. Tomescu I.: Some extremal properties of the degree distance of a graph. Discret. Appl. Math. 98, 159-163 (1999).
17. Tomescu I.: Properties of connected graphs having minimum degree distance. Discret. Math. 309, 2745-2748 (2009).
18. Tomescu A. I.: Unicyclic and bicyclic graphs having minimum degree distance. Discret. Appl. Math. 156, 125-130 (2008).
19. Tomescu, A. I.: Minimal graphs with respect to the degree distance, University of Bucharest. Technical report (2008). http://sole. dimi. uniud. it/~alexandru. tomescu/files/dd-distance. pdf.
20. Yu A., Tian F.: On the spectral radius of unicyclic graphs. MATCH Commun. Math. Comput. Chem. 51, 97-109 (2004).
21. Yuan H., An C.: The unicyclic graphs with maximum degree distance. J. Math. Study 39, 18-24 (2006).
22. Zhou B.: Bounds for the Schultz molecular topological index. MATCH Commun. Math. Comput. Chem. 56, 189-194 (2006).