Article ID Journal Published Year Pages File Type
421111 Discrete Applied Mathematics 2015 14 Pages PDF
Abstract

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first multiplicative Zagreb index. Specifically, after characterizing cc-cyclic graphs (0≤c≤6)(0≤c≤6) as those whose degree sequence belongs to particular subsets of RnRn, we identify the maximal and minimal vectors of these subsets with respect to the majorization order. This technique allows us to determine lower and upper bounds of the above indices recovering some existing results in the literature as well as obtaining new ones.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,