On Zagreb indices of graphs
Combinatorics
2023-09-26 v1
Abstract
Let be the set of class of graphs of order . The first Zagreb index is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph . 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 . Finally, we give a conjecture .
Cite
@article{arxiv.2305.05878,
title = {On Zagreb indices of graphs},
author = {Batmend Horoldagva and Kinkar Chandra Das},
journal= {arXiv preprint arXiv:2305.05878},
year = {2023}
}