Neighbourhood second Zagreb matrix of graphs: spectral radius bounds and extremal graphs

Abstract

Let $G$ be a connected graph on at least two vertices, and let $\delta (i)$ be the sum of the degrees of the neighbours of a vertex $i$. The \emph{neighbourhood second Zagreb matrix} $\NF(G)$ has $(i,j)$-entry $\delta (i)\delta (j)$ if $i\sim j$ and $0$ otherwise; its spectral radius is denoted by $\rNF(G)$. We prove that $\rNF(G)\geρ(G)^{5}$, where $\rho (G)$ is the adjacency spectral radius, with equality if and only if $G$ is regular or bipartite semiregular, and we use this to show that the same graphs are exactly the extremal graphs of a Berman--Zhang--type upper bound. We sharpen the estimates $\demin^{2}ρ(G)\le\rNF(G)\le\demax^{2}ρ(G)$ by means of the extreme edge weights of $\NF(G)$, give sharp upper bounds in terms of the maximum degree $\dmax$, the maximum neighbourhood degree sum $\demax$, the size $m$ and the clique number $\omega (G)$, and determine the extremal graphs for bipartite graphs and trees. For every connected unicyclic graph $G$ of order $n\ge 3$ we prove $32=\rNF(C_n)\le\rNF(G)\le\rNF(\Sp n)$, where $\Sp n$ is the triangle with $n-3$ pendant edges at one vertex, with equality only for $C_n$ and only for $\Sp n$, respectively. Finally, we give bounds in terms of the first Zagreb index and for the neighbourhood second Zagreb energy; for lower energy bounds, the extremal graphs are described completely.

arXiv comment23 pages