Add to ORKGFor a graph G, the first Zagreb index is defined as the sum of the squares of the vertices degrees. By investigating the connection between the first Zagreb index and the first three coefficients of the Laplacian characteristic polynomial, we give a lower bound for the first Zagreb index, and we determine all corresponding extremal graphs. By doing so, we generalize some known results, and, as an application, we use these results to study the Laplacian spectral determination of graphs with small first Zagreb index
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matr...
AbstractLet k≥2 be an integer, a k-decomposition (G1,G2,…,Gk) of the complete graph Kn is a partitio...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
For a graph G, the first Zagreb index is defined as the sum of the squares of the vertices degrees. ...
Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^...
AbstractIn this paper, we present sharp bounds for the Zagreb indices, Harary index and hyper-Wiener...
AbstractFor a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the ver...
AbstractThe first Zagreb index M1(G) and the second Zagreb index M2(G) of a (molecular) graph G are ...
For a (molecular) graph G, the first and the second entire Zagreb indices are defined by the formula...
The first and second Hyper-Zagreb index of a connected graph $G$ is defined by $HM_{1}(G)=\sum_{uv \...
AbstractThe first and second reformulated Zagreb indices are defined respectively in terms of edge-d...
The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the che...
Abstract. Let G be a connected graph with n vertices and m edges. Let q1, q2,..., qn be the eigenval...
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 ...
We give sharp lower bounds for the Zagreb eccentricity indices of connected graphs with fixed number...
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matr...
AbstractLet k≥2 be an integer, a k-decomposition (G1,G2,…,Gk) of the complete graph Kn is a partitio...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...
For a graph G, the first Zagreb index is defined as the sum of the squares of the vertices degrees. ...
Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^...
AbstractIn this paper, we present sharp bounds for the Zagreb indices, Harary index and hyper-Wiener...
AbstractFor a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the ver...
AbstractThe first Zagreb index M1(G) and the second Zagreb index M2(G) of a (molecular) graph G are ...
For a (molecular) graph G, the first and the second entire Zagreb indices are defined by the formula...
The first and second Hyper-Zagreb index of a connected graph $G$ is defined by $HM_{1}(G)=\sum_{uv \...
AbstractThe first and second reformulated Zagreb indices are defined respectively in terms of edge-d...
The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the che...
Abstract. Let G be a connected graph with n vertices and m edges. Let q1, q2,..., qn be the eigenval...
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 ...
We give sharp lower bounds for the Zagreb eccentricity indices of connected graphs with fixed number...
Let G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplacian matr...
AbstractLet k≥2 be an integer, a k-decomposition (G1,G2,…,Gk) of the complete graph Kn is a partitio...
AbstractLet G be a simple undirected n-vertex graph with the characteristic polynomial of its Laplac...