相关论文: A note on polyomino chains with extremum general s…

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,…

Let $G=(V_G, E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^{d}(G) = \sum_{v\in V_G}\varepsilon_{G}(v)D_{G}(v)$, where $\varepsilon_G(v)$ is the eccentricity of the vertex $v$ and $D_G(v) =…

A set of edges $X\subseteq E(G)$ of a graph $G$ is an edge general position set if no three edges from $X$ lie on a common shortest path. The edge general position number ${\rm gp}_{\rm e}(G)$ of $G$ is the cardinality of a largest edge…

The Kirchhoff index $Kf(G)$ of a graph $G$ is the sum of resistance distances between all unordered pairs of vertices, which was introduced by Klein and Randi\'c. In this paper we characterized all extremal graphs with Kirchhoff index among…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized…

The famous lower bound $\alpha(G)\geq \sum_{u\in V(G)}\frac{1}{d_G(u)+1}$ on the independence number $\alpha(G)$ of a graph $G$ due to Caro and Wei is known to be tight if and only if the components of $G$ are cliques, and has been…

A {\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\ell$ of $G$ for every two adjacent vertices $v$ and $u$, the sum of incoming edges of $v$ and $u$ in the oriented graph are…

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…

In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit…

The \emph{eccentricity} of a vertex $u$ in a graph $G$, denoted by $e_G(u)$, is the maximum distance from $u$ to other vertices in $G$. We study extremal problems for the average eccentricity and the first and second Zagreb eccentricity…

Let $G$ be a finite, simple connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ of $G$ is the maximum of the average distances…

The energy of a graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. Let $G$ be a graph of order $n$ and ${\rm rank}(G)$ be the rank of the adjacency matrix of $G$. In this paper we…

The Wiener index W(G) of a connected graph $G$ is the sum of distances between all pairs of vertices in G$. In this paper, we first give the recurrences or explicit formulae for computing the Wiener indices of spiro and polyphenyl hexagonal…

Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index $SO$ of a graph $G$, and is defined by $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_G(u)^2+d_G(v)^2},$$ where $d_G(v)$ is the degree of the vertex $v$ of $G$. In…

For a simple graph $G(V,E)$, the zeroth-order general Randi\' c index is defined as $^0R_{\alpha}(G)=\sum_{v\in V(G)}d(v)^{\alpha}$, where $d(v)$ is the degree of the vertex $v$ and $\alpha\ne0$ is a real number. The $k$-generalized…

Let $G$ be a graph of order $n$ and let $u,v$ be vertices of $G$. Let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then the average connectivity $\overline{\kappa}(G)$ of $G$, is defined as $…

The Randi{\' c} index of a graph $G$, written $R(G)$, is the sum of $\frac 1{\sqrt{d(u)d(v)}}$ over all edges $uv$ in $E(G)$. %let $R(G)=\sum_{uv \in E(G)} \frac 1{\sqrt{d(u)d(v)}}$, which is called the Randi{\' c} index of it. Let $d$ and…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

The Sombor index of a graph $G$ was recently introduced by Gutman from the geometric point of view, defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{d(u)^2+d(v)^2}$, where $d(u)$ is the degree of a vertex $u$. For two real numbers $\alpha$ and…

Consider a finite connected graph denoted as $G=(V, E)$. This study explores a generalized Chern-Simons Higgs model, characterized by the equation: $$ \Delta u = \lambda e^u (e^u - 1)^{2p+1} + f,$$ where $\Delta$ denotes the graph…