Maximum first Zagreb index of orientations of bicyclic graphs with given matching number

Authors:
  • JYJiaxiang Yang
    Jiaxiang Yang
  • HDHanyuan Deng
    Hanyuan Deng

Abstract
Let $D=(V, A)$ be a digraphs without isolated vertices. The first Zagreb index of a digraph $D$ defined as a sum of the weights $(d^{+}_u+d^{+}_v)$ of all $uv\in A(D)$, where $d^{+}_u$ (resp. $d^{-}_u$) denotes the out-degree (resp. in-degree) of the vertex $u$. We solve the problem on the maximal values and maximal digraphs of first Zagreb index over all oriented bicyclic graphs with $n$ vertices and matching number $m$ $(3\leq m\leq \lfloor \frac{n}{2}\rfloor)$ in this paper.