Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u) 2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations
A topological index of a graph is a parameter related to the graph; it does not depend on labeling o...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
Let G be a simple, undirected and connected graph. Defined by M1(G) and RMTI(G) the first Zagreb ind...
The multiplicative first Zagreb index of a graph H is defined as the product of the squares of the d...
The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the che...
The reformulated first Zagreb index is the edge version of first Zagreb index of chemical graph theo...
New graph invariants, named exponential Zagreb indices, are introduced for more than one type of Zag...
For a simple graph G with n vertices and m edges, the first Zagreb index and the second Zagreb index...
The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replaci...
For a graph G, the first Zagreb index is defined as the sum of the squares of the vertices degrees. ...
The first Zagreb index is defined as the sum of squares of the degrees of vertices in a graph. The n...
Many researchers have studied several operators on a connected graph in which one make an attempt on...
The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let H ...
The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacin...
Let G = (V,E) be a simple graph with n = |V | vertices and m = |E | edges. The first and second Zagr...
A topological index of a graph is a parameter related to the graph; it does not depend on labeling o...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
Let G be a simple, undirected and connected graph. Defined by M1(G) and RMTI(G) the first Zagreb ind...
The multiplicative first Zagreb index of a graph H is defined as the product of the squares of the d...
The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the che...
The reformulated first Zagreb index is the edge version of first Zagreb index of chemical graph theo...
New graph invariants, named exponential Zagreb indices, are introduced for more than one type of Zag...
For a simple graph G with n vertices and m edges, the first Zagreb index and the second Zagreb index...
The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replaci...
For a graph G, the first Zagreb index is defined as the sum of the squares of the vertices degrees. ...
The first Zagreb index is defined as the sum of squares of the degrees of vertices in a graph. The n...
Many researchers have studied several operators on a connected graph in which one make an attempt on...
The Zagreb eccentricity indices are the eccentricity reformulation of the Zagreb indices. Let H ...
The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacin...
Let G = (V,E) be a simple graph with n = |V | vertices and m = |E | edges. The first and second Zagr...
A topological index of a graph is a parameter related to the graph; it does not depend on labeling o...
AbstractThe index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with...
Let G be a simple, undirected and connected graph. Defined by M1(G) and RMTI(G) the first Zagreb ind...