相关论文: The Second Zagreb Indices of Graphs with Given Deg…

In this paper, we examine a specific type of random chains and propose an unified approach to studying the degree-based topological indices, including their extreme values. We derive explicit analytical expressions for the expected values…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex…

We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\le m\le \lfloor\frac{n}{2}\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum…

Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order…

Many existing degree based topological indices can be classified as bond incident degree (BID) indices, whose general form is $BID(G)=\sum_{uv\in E(G)}$ $\Psi(d_{u},d_{v})$, where $uv$ is the edge connecting the vertices $u,v$ of the graph…

In the paper [I. Gutman, N. Trinajsti\'c, Chem. Phys. Lett. 17 (1972), 535], it was shown that total $\pi$-electron energy ($E$) of a molecule $M$ depends on the quantity $\sum_{v\in V(G)}d_{v}^{2}$ (nowadays known as the "first Zagreb…

Let $G$ be a simple connected graph with the vertex set $V(G)$ and $d_{B}^2(u,v)$ be the biharmonic distance between two vertices $u$ and $v$ in $G$. The biharmonic index $BH(G)$ of $G$ is defined as $$BH(G)=\frac{1}{2}\sum\limits_{u\in…

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

Let $G=(V,E)$ be a simple undirected and connected graph on $n$ vertices. The Graovac--Ghorbani index of a graph $G$ is defined as $$ABC_{GG}(G)= \sum_{uv \in E(G)} \sqrt{\frac{n_{u}+n_{v}-2} {n_{u} n_{v}}},$$ where $n_u$ is the number of…

Let $G$ be a molecular graph. The total-eccentricity index of graph $G$ is defined as the sum of eccentricities of all vertices of $G$. %In [R. Farooq, M.A. Malik, J. Rada, Extremal graphs with respect to total-eccentricity index, 2017,…

The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and…

Do\v{s}li\'{c} et al.~defined the Mostar index of a graph $G$ as $\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to…

In this article, we investigate the Zagreb index, a kind of graph-based topological index, of several random networks, including a class of networks extended from random recursive trees, plain-oriented recursive trees, and random…

In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.

Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$. The signless…

Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in…

Augmented Zagreb Index is a newly defined degree based topological invariant which has been well established for its better correlation properties and is defined as $AZI(G)= \sum_{uv\in E(G)}(\frac{d_G (u)d_G (v)}{d_G (u)+ d_G (v)-2})^3 $,…

Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. The Sombor index of the graph $G$ is a degree-based topological index, defined as $$SO(G)=\sum_{uv \in E}\sqrt{d(u)^2+d(v)^2},$$ in which $d(x)$ is the degree of the…

This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…