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 Citations (Scopus)

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

Fingerprint

Zagreb Index
Edge-connectivity
Time Constant
Directly proportional
Molecules
Output

All Science Journal Classification (ASJC) codes

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

Cite this

Vukičević, Damir ; Rajtmajer, Sarah ; Trinajstić, Nenad. / Trees with maximal second Zagreb index and prescribed number of vertices of the given degree. In: Match. 2008 ; Vol. 60, No. 1. pp. 65-70.
@article{e825325fced240a682609ef026a5f0af,
title = "Trees with maximal second Zagreb index and prescribed number of vertices of the given degree",
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.",
author = "Damir Vukičević and Sarah Rajtmajer and Nenad Trinajstić",
year = "2008",
month = "7",
day = "10",
language = "English (US)",
volume = "60",
pages = "65--70",
journal = "Match",
issn = "0340-6253",
publisher = "University of Kragujevac, Faculty of Science",
number = "1",

}

Trees with maximal second Zagreb index and prescribed number of vertices of the given degree. / Vukičević, Damir; Rajtmajer, Sarah; Trinajstić, Nenad.

In: Match, Vol. 60, No. 1, 10.07.2008, p. 65-70.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Vukičević, Damir

AU - Rajtmajer, Sarah

AU - Trinajstić, Nenad

PY - 2008/7/10

Y1 - 2008/7/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46449103239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449103239&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:46449103239

VL - 60

SP - 65

EP - 70

JO - Match

JF - Match

SN - 0340-6253

IS - 1

ER -