Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 92, 2015 - Issue 10
Submit an article Journal homepage
140
Views
0
CrossRef citations to date
0
Altmetric
SECTION A

Extremal values on the harmonic number of trees

Qiong FanSchool of Automation, Huazhong University of Science and Technology, Wuhan430074, China;Faculty of Mathematics and Statistics, Central China Normal University, Wuhan430079, China
,
Shuchao LiFaculty of Mathematics and Statistics, Central China Normal University, Wuhan430079, ChinaCorrespondence[email protected]
&
Qin ZhaoSchool of Mathematics and Statistics, Hubei University, Wuhan430062, China
Pages 2036-2050 | Received 11 Sep 2013, Accepted 02 Sep 2014, Published online: 13 Oct 2014

References

  • B. Bollobás and P. Erdős, Graphs of extremal weights, Ars Combin. 50 (1998), pp. 225–233.
  • R.A. Brualdi and J.L. Goldwasser, Permanent of the Laplacian matrix of trees and bipartite graphs, Discrete Math. 48 (1984), pp. 1–21. doi: 10.1016/0012-365X(84)90127-4
  • J.J. Chen and S.C. Li, On the sum-connectivity index of unicyclic graphs with k pendent vertices, Math. Commun. 16(2) (2011), pp. 359–368.
  • H.Y. Deng, S. Balachandran, S.K. Ayyaswamy, and Y.B. Venkatakrishnan, On the harmonic index and chromatic number of a graph, Discrete Appl. Math. 161(16–17) (2013), pp. 2740–2744. doi: 10.1016/j.dam.2013.04.003
  • Z.B. Du, B. Zhou, and N. Trinajstić, Minimum general sum-connectivity index of unicyclic graphs, J. Math. Chem. 48 (2010), pp. 697–703. doi: 10.1007/s10910-010-9702-6
  • Z.B. Du, B. Zhou, and N. Trinajstić, On general sum-connectivity index of trees, Appl. Math. Lett. 24 (2011), pp. 402–405. doi: 10.1016/j.aml.2010.10.038
  • S. Fajtlowicz, On conjectures of Graffiti-II, Congr. Numer. 60 (1987), pp. 187–197.
  • O. Favaron, M. Mahio, and J.F. Saclé, Some eigenvalue properties in graphs (conjectures of Graffiti-II), Discrete Math. 111 (1993), pp. 197–220. doi: 10.1016/0012-365X(93)90156-N
  • J.F. Fink, M.S. Jocobson, L.K. Kinch, and J. Roberts, On graphs having domination number half their order, Period. Math. Hungar. 16 (1985), pp. 287–293. doi: 10.1007/BF01848079
  • X.Y. Geng, S.C. Li, and M. Zhang, Extremal values on the eccentric distance sum of trees, Discrete Appl. Math. 161(16–17) (2013), pp. 2427–2439. doi: 10.1016/j.dam.2013.05.023
  • Y. Hou and J. Li, Bounds on the largest eigenvalues of trees with a given size of matching, Linear Algebra Appl. 342 (2002), pp. 203–217. doi: 10.1016/S0024-3795(01)00465-7
  • S. Kitaev and J. Liese, Harmonic numbers, Catalans triangle and mesh patterns, Discrete Math. 313 (2013), pp. 1515–1531. doi: 10.1016/j.disc.2013.03.017
  • X. Li and I. Gutman, Mathematical Aspects of Randić-Type Molecular Structure Descriptors, University of Kragujevac, Kragujevac, 2006.
  • B. Lučić, N. Trinajstić, and B. Zhou, Comparison between the sum-connectivity index and product-connectivity index for benzenoid hydrocarbons, Chem. Phys. Lett. 475 (2009), pp. 146–148. doi: 10.1016/j.cplett.2009.05.022
  • O. Ore, Theory of Graphs, Vol. 38, American Mathematical Society Colloquium Publications, Providence, R.I., 1962.
  • M. Randić, On characterization of molecular branching, J. Am. Chem. Soc. 97 (1975), pp. 6690–6615. doi: 10.1021/ja00856a001
  • B.G. Xu, E.J. Cockayne, T.W. Haynes, S.T. Hedetniemi, and S.C. Zhou, Extremal graphs for inequalities involving domination parameters, Discrete Math. 216 (2000), pp. 1–10. doi: 10.1016/S0012-365X(99)00251-4
  • K.X. Xu and L.H. Feng, Extremal energies of trees with a given domination number, Linear Algebra Appl. 435 (2011), pp. 2382–2393. doi: 10.1016/j.laa.2010.09.008
  • L.P. Zhong, The harmonic index for graphs, Appl. Math. Lett. 25 (2012), pp. 561–566. doi: 10.1016/j.aml.2011.09.059
  • B. Zhou and N. Trinajstić, On a novel connectivity index, J. Math. Chem. 46 (2009), pp. 1252–1270. doi: 10.1007/s10910-008-9515-z
  • B. Zhou and N. Trinajstić, On general sum-connectivity index, J. Math. Chem. 47 (2010), pp. 210–218. doi: 10.1007/s10910-009-9542-4

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.