Add to ORKGIn this paper, we focus on comparing the first and second Zagreb-Fermat eccentricity indices of graphs. We show that $$\frac{\sum_{uv\in E\left( G \right)}{\varepsilon_3\left( u \right) \varepsilon_3\left( v \right)}}{m\left( G \right)} \leq \frac{\sum_{u\in V\left( G \right)}{\varepsilon_{3}^{2}\left( u \right)}}{n\left( G \right)} $$ holds for all acyclic and unicyclic graphs. Besides, we verify that the inequality may not be applied to graphs with at least two cycles
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom...
AbstractIt was conjectured that for each simple graph G=(V,E) with n=|V(G)| vertices and m=|E(G)| ed...
For a connected graph (G), the eccentric connectivity index (ECI) and the first Zagreb eccentricity ...
We give sharp lower bounds for the Zagreb eccentricity indices of connected graphs with fixed number...
The concept of Zagreb eccentricity indices was introduced in the chemical graph theory very recently...
Let G=(V,E) be a simple graph with n=|V| vertices and m=|E| edges. The first and the second Zagreb i...
The Zagreb eccentricity indices are the eccentricity version of the classical Zagreb indices. The fi...
International audience{Recently Hansen and Vukicevic proved that the inequality $M_1/n \leq M_2/m$, ...
AbstractFor a simple graph G with n vertices and m edges, the inequality M1(G)/n≤M2(G)/m, where M1(G...
AbstractFor a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the...
International audienceFor a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(...
AbstractIn this paper, we present sharp bounds for the Zagreb indices, Harary index and hyper-Wiener...
AbstractThe first Zagreb index M1(G) and the second Zagreb index M2(G) of a (molecular) graph G are ...
The first and second Zagreb eccentricity indices (EM1 and EM2), the eccentric distance sum (EDS), an...
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom...
AbstractIt was conjectured that for each simple graph G=(V,E) with n=|V(G)| vertices and m=|E(G)| ed...
For a connected graph (G), the eccentric connectivity index (ECI) and the first Zagreb eccentricity ...
We give sharp lower bounds for the Zagreb eccentricity indices of connected graphs with fixed number...
The concept of Zagreb eccentricity indices was introduced in the chemical graph theory very recently...
Let G=(V,E) be a simple graph with n=|V| vertices and m=|E| edges. The first and the second Zagreb i...
The Zagreb eccentricity indices are the eccentricity version of the classical Zagreb indices. The fi...
International audience{Recently Hansen and Vukicevic proved that the inequality $M_1/n \leq M_2/m$, ...
AbstractFor a simple graph G with n vertices and m edges, the inequality M1(G)/n≤M2(G)/m, where M1(G...
AbstractFor a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the...
International audienceFor a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(...
AbstractIn this paper, we present sharp bounds for the Zagreb indices, Harary index and hyper-Wiener...
AbstractThe first Zagreb index M1(G) and the second Zagreb index M2(G) of a (molecular) graph G are ...
The first and second Zagreb eccentricity indices (EM1 and EM2), the eccentric distance sum (EDS), an...
In this paper, we introduce the first and second distance eccentricity Zagreb indices of a connected...
Let $G=(V,E)$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. The third atom...
AbstractIt was conjectured that for each simple graph G=(V,E) with n=|V(G)| vertices and m=|E(G)| ed...