Open AccessOn the maximum and minimum first reformulated Zagreb index of graphs with connectivity at most k
Author(s) -
Guifu Su,
Liming Xiong,
Lan Xu,
Beibei Ma
Publication year - 2011
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1104075s
Subject(s) - mathematics , generalization , combinatorics , index (typography) , topological index , graph , graph theory , discrete mathematics , mathematical analysis , world wide web , computer science
The authors Milicevic et al. introduced the reformulated Zagreb indices [1], which is a generalization of classical Zagreb indices of chemical graph theory. In this paper, we mainly consider the maximum and minimum for the first reformulated index of graphs with connectivity at most k. The corresponding extremal graphs are characterized.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom