Trees with maximal second Zagreb index and prescribed number of vertices of the given degree

Damir Vukičević, Sarah Rajtmajer, Nenad Trinajstić

Research output: Contribution to journalArticle

29 Scopus citations

Abstract

In this paper we present a simple algorithm for calculating the maximal value of the second Zagreb index for trees with prescribed number of vertices of given degree. The user needs only to input values n 1 , n 2 ,...,n δ where n i is the number of vertices of degree i. The algorithm outputs the edge connectivity values m ij as well as the maximal value of the second Zagreb index. The complexity of the algorithm is proportional to Δ 3 , where Δ is maximal degree. Since complexity is independent of the number of vertices, for chemical trees that have Δ ≤ 4 the algorithm works in constant time no matter how large the molecule is.

Original languageEnglish (US)
Pages (from-to)65-70
Number of pages6
JournalMatch
Volume60
Issue number1
StatePublished - Jul 10 2008

All Science Journal Classification (ASJC) codes

  • Chemistry(all)
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Trees with maximal second Zagreb index and prescribed number of vertices of the given degree'. Together they form a unique fingerprint.

  • Cite this