arXiv Analytics

Sign in

arXiv:2305.05878 [math.CO]AbstractReferencesReviewsResources

On Zagreb indices of graphs

Batmend Horoldagva, Kinkar Chandra Das

Published 2023-05-10Version 1

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph $G$. The three set of graphs are as follows: \begin{eqnarray*} &&A=\left\{G\in {\mathcal G}_n:\,\frac{M_1(G)}{n}>\frac{M_2(G)}{m}\right\},~B=\left\{G\in {\mathcal G}_n:\,\frac{M_1(G)}{n}=\frac{M_2(G)}{m}\right\} \mbox{ and }&& &&~~~~~~~~~~~~~~~~~~~~~~~~~C=\left\{G\in {\mathcal G}_n:\,\frac{M_1(G)}{n}<\frac{M_2(G)}{m}\right\}. \end{eqnarray*} In this paper we prove that $|A|+|B|<|C|$. Finally, we give a conjecture $|A|<|B|$.

Related articles: Most relevant | Search more
arXiv:1801.07025 [math.CO] (Published 2018-01-22)
Spanning trees without adjacent vertices of degree 2
arXiv:2107.00424 [math.CO] (Published 2021-07-01)
A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs
arXiv:2211.05559 [math.CO] (Published 2022-11-10)
Greedy trees have minimum Sombor indices