creative_2021_30_2_189_196A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is the out degree of the vertex. The Zagreb index of a tournament is defined as the sum of the squares of the scores of its vertices. The first general Zagreb index of a tournament 
is defined as 
, where 
is any real number other than 
and 
. In this paper, we obtain various lower and upper bounds for the first general Zagreb index of a tournament.
| Author(s) | Chishti, T. A., Naikoo, Tariq A., Pirzada, S., Rather, Bilal A. |
|---|
Reciprocal distance spectrum of Indu-Bala product of graphs
Some classes of distance spaces as generalized metric spaces: terminology, mappings, fixed points and applications in Theoretical Informatics
Uniqueness of Shift Polynomials and Derivative Sharing Polynomial
Diffeomorphic embedding of Higher-dimensional Hilbert Manifolds into Hilbert spaces
Approximating fixed points of the SP*-iteration for generalized nonexpansive mappings in CAT(0) spaces
Leverage Centrality in Corona Product of Cycle with some Graphs
Some new results on WS-algebras
On Duo Γ-semihyperrings
Comparative Study of Different Vacation Schemes in an Inventory System with Production and Multiple Servers
Isomorphism of Line Graph and Common Neighbourhood Graph
