Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T08:04:12.838Z Has data issue: false hasContentIssue false
  • English
  • Français

ON MAXIMAL ENERGY AND HOSOYA INDEX OF TREES WITHOUT PERFECT MATCHING

Part of: Graph theory

Published online by Cambridge University Press:  27 July 2009

HONGBO HUA
HONGBO HUA*
Affiliation:
Department of Computing Science, Huaiyin Institute of Technology, Huaian, Jiangsu 223003, PR China (email: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let G be a simple undirected graph. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacent matrix of G, and the Hosoya index Z(G) of G is the total number of matchings in G. A tree is called a nonconjugated tree if it contains no perfect matching. Recently, Ou [‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett.19 (2006), 652–656] determined the unique element which is maximal with respect to Z(G) among the family of nonconjugated n-vertex trees in the case of even n. In this paper, we provide a counterexample to Ou’s results. Then we determine the unique maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated n-vertex trees for the case when n is even. As corollaries, we determine the maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated chemical trees on n vertices, when n is even.

Keywords

treeperfect matchingenergy of graphspectra of graphHosoya indexk matchings

MSC classification

Secondary: 05C50: Graphs and linear algebra (matrices, eigenvalues, etc.) 05C35: Extremal problems
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 81 , Issue 1 , February 2010 , pp. 47 - 57
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2009

References

[1]Caporossi, G., Cvetković, D., Gutman, I. and Hansen, P., ‘Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy’, J. Chem. Inf. Comput. Sci. 39 (1999), 984–996.CrossRefGoogle Scholar
[2]Cvetković, D., Doob, M. and Sachs, H., Spectra of Graphs (Academic Press, New York, 1980).Google Scholar
[3]Godsil, C. D., Algebraic Combinatorics (Chapman & Hall, London, 1993).Google Scholar
[4]Gutman, I., ‘Acyclic systems with extremal Huckel π-electron energy’, Theor. Chim. Acta. 45 (1977), 79–87.CrossRefGoogle Scholar
[5]Gutman, I., ‘The energy of a graph: old and new results’, in: Algebraic Combinatorics and Applications (Gößweinstein, 1999) (eds. Betten, A., Kohnert, A., Laue, R. and Wassermann, A.) (Springer, Berlin, 2001), pp. 196–211.CrossRefGoogle Scholar
[6]Gutman, I. and Cyvin, S. J., ‘A new method for the enumeration of Kekulé structures’, Chem. Phys. Lett. 136 (1987), 137–140.CrossRefGoogle Scholar
[7]Gutman, I., Furtula, B. and Hua, H., ‘Bipartite unicyclic graphs with maximal, second-maximal and third-maximal energy’, MATCH Commun. Math. Comput. Chem. 58 (2007), 75–82.Google Scholar
[8]Gutman, I. and Polansky, O. E., Mathematical Concepts in Organic Chemistry (Springer, Berlin, 1986).Google Scholar
[9]Gutman, I. and Zhang, F., ‘On the ordering of graphs with respect to their matching numbers’, Discrete Appl. Math. 15 (1986), 25–33.CrossRefGoogle Scholar
[10]Hou, Y., ‘Unicyclic graphs with minimal energy’, J. Math. Chem. 3 (2001), 163–168.CrossRefGoogle Scholar
[11]Hou, Y., ‘On acyclic systems with minimal Hosoya index’, Discrete Appl. Math. 119 (2002), 251–257.CrossRefGoogle Scholar
[12]Hua, H., ‘On minimal energy of unicyclic graphs with prescribed girth and pendent vertices’, MATCH Commun. Math. Comput. Chem. 57 (2007), 351–361.Google Scholar
[13]Hua, H., ‘Bipartite unicyclic graphs with large energy’, MATCH Commun. Math. Comput. Chem. 58 (2007), 57–73.Google Scholar
[14]Hua, H., ‘Minimizing a class of unicyclic graphs by means of Hosoya index’, Math. Comput. Modelling 48 (2008), 940–948.CrossRefGoogle Scholar
[15]Hua, H. and Wang, M., ‘Unicyclic graphs with given number of pendent vertices and minimal energy’, Linear Algebra Appl. 426 (2007), 478–489.CrossRefGoogle Scholar
[16]Li, X., Zhang, J. and Wang, L., ‘On bipartite graphs with minimal energy’, Discrete Appl. Math. 157(4) (2009), 869–873. doi: 10.1016/j.dam.2008.07.008.CrossRefGoogle Scholar
[17]Liu, H. and Lu, M., ‘A unified approach to extremal cacti for different indices’, MATCH Commun. Math. Comput. Chem. 58 (2007), 193–204.Google Scholar
[18]Ou, J., ‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett. 19 (2006), 652–656.Google Scholar
[19]Ou, J., ‘On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index’, J. Math. Chem. 42 (2007), 423–432.CrossRefGoogle Scholar
[20]Ou, J., ‘On extremal unicyclic molecular graphs with maximal Hosoya index’, Discrete Appl. Math. 157 (2009), 391–397.CrossRefGoogle Scholar
[21]Wang, D. and Hua, H., ‘Minimality considerations for graph energy over a class of graphs’, Comput. Math. Appl. 56 (2008), 3181–3187.Google Scholar
[22]Wang, M., Hua, H. and Wang, D., ‘Minimal energy on a class of graphs’, J. Math. Chem. 43 (2008), 1389–1402.CrossRefGoogle Scholar
[23]Yan, W. and Ye, L., ‘On the maximal energy and the Hosoya index of a type of trees with many pendant vertices’, MATCH Commun. Math. Comput. Chem. 53 (2005), 449–459.Google Scholar
[24]Yu, A. and Lv, X., ‘Minimum energy on trees with k pendent vertices’, Linear Algebra Appl. 418 (2007), 625–633.CrossRefGoogle Scholar
[25]Yu, A. and Lv, X., ‘The Merrifield–Simmons and Hosoya indices of trees with k pendent vertices’, J. Math. Chem. 41 (2007), 33–43.CrossRefGoogle Scholar
[26]Zhou, B. and Li, F., ‘On minimal energies of trees of a prescribed diameter’, J. Math. Chem. 39 (2006), 465–473.CrossRefGoogle Scholar