On the Zagreb Indices Equality

Details On the Zagreb Indices Equality On the Zagreb Indices Equality

2011-06-09

arxiv.org/abs/1106.1809v1

Computer Science

Discrete Mathematics

11 pages, 1 figure

Scientific paper

For a simple graph $G$ with $n$ vertices and $m$ edges, the first Zagreb index and the second Zagreb index are defined as $M_1(G)=\sum_{v\in V}d(v)^2 $ and $M_2(G)=\sum_{uv\in E}d(u)d(v)$. In \cite{VGFAD}, it was shown that if a connected graph $G$ has maximal degree 4, then $G$ satisfies $M_1(G)/n = M_2(G)/m$ (also known as the Zagreb indices equality) if and only if $G$ is regular or biregular of class 1 (a biregular graph whose no two vertices of same degree are adjacent). There, it was also shown that there exist infinitely many connected graphs of maximal degree $\Delta= 5$ that are neither regular nor biregular of class 1 which satisfy the Zagreb indices equality. Here, we generalize that result by showing that there exist infinitely many connected graphs of maximal degree $\Delta \geq 5$ that are neither regular nor biregular graphs of class 1 which satisfy the Zagreb indices equality. We also consider when the above equality holds when the degrees of vertices of a given graph are in a prescribed interval of integers.

Affiliated with

Also associated with

No associations

Rating

On the Zagreb Indices Equality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Zagreb Indices Equality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Zagreb Indices Equality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580288