On the first outdegree Zagreb index of a digraph (Q6080208)

The paper provides a thorough exploration of the first outdegree Zagreb index $(Zg^+(D))$ for a directed graph $(D)$. The authors successfully establish various upper and lower bounds for $(Zg^+(D))$ in terms of the number of vertices $(n)$ and arcs $(a)$, offering a comprehensive understanding of the index's behavior. The characterization of extremal digraphs achieving these bounds adds depth to the analysis, enhancing the significance of the results. The identification of digraphs attaining the maximum, second maximum, and third maximum values for $(Zg^+(D))$ among all digraphs and bipartite digraphs of order \(n\) provides valuable insights into the distribution of this index within different classes of digraphs. The investigation into digraphs achieving the maximum value of $(Zg^+(D))$ among those with underlying graphs having $(m \leq n + 2)$ edges is a notable contribution, expanding the applicability of the results. Additionally, the discussion on the orientations of a path $(P_n)$ and the determination of the path with $(n - 1)$ vertices of outdegree 1 attaining the minimum value for $(Zg^+(D))$ contribute to the overall completeness of the study.