pith. sign in

arxiv: 1311.5691 · v1 · pith:RS3LTZZ6new · submitted 2013-11-22 · 🧮 math.CO · math.OC

New bounds of degree-based topological indices for some classes of c-cyclic graphs

classification 🧮 math.CO math.OC
keywords boundsgraphsindicescyclicdegreefirstindexlower
0
0 comments X
read the original 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 $c-$cyclic graphs $(0\leq c\leq 6)$ as those whose degree sequence belongs to particular subsets of $\mathbb{R}^{n}$, 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 those existing in the literature as well obtaining new ones.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.