相关论文: On bicyclic graphs with maximal Graovac-Ghorbani i…

The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph. This is a generalization of eccentric connectivity…

Let $G_w$ be a weighted graph. The number of the positive, negative and zero eigenvalues in the spectrum of $G_w$ are called positive inertia index, negative inertia index and nullity of $G_w$, and denoted by $i_{+}(G_w)$, $i_{-}(G_w)$,…

The zeroth-order general Randi\'{c} index $R^{0}_{a}$ of a digraph $D$ is the sum of $(d^{+}_{v})^{a}+(d^{-}_{w})^{a}$ over all arcs $vw$ of $D$, where $a$, $d^{+}_{v}$ and $d^{-}_{w}$ are an arbitrary real number, the out-degree of the…

The complementary second Zagreb index of a graph $G$ is defined as $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$, where $d_u(G)$ denotes the degree of a vertex $u$ in $G$ and $E(G)$ represents the edge set of $G$. Let $G^*$ be a graph…

The first Zagreb index $M_{1}$ of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index $M_{2}$ of a graph is defined as the sum of the product of vertex degrees of each pair of adjacent vertices.…

For a graph $G$ with vertex set $V$, let N($G$) denote the number of nonempty subsets of $V$ that induce a connected graph in $G$. In this paper, we focus on determining N($G$) for $G$ in the family $\mathbb{B}_n$ of $n$-vertex bicyclic…

In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…

The Kirchhoff index of graphs, introduced by Klein and Randi\'{c} in 1993, has been known useful in the study of computer science, complex network and quantum chemistry. The Kirchhoff index of a graph $G$ is defined as…

We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.

The eccentric-connectivity index of a graph G is the sum of the products of the eccentricity and the degree of each vertex in G. In this paper, we define four new invariants related to the eccentric-connectivity index and obtain upper…

Recently in 2021, Gutman introduced the Sombor index of a graph, a novel degree-based topological index. It has been shown that the Sombor index efficiently models the thermodynamic properties of chemical compounds. Assume $\mathbb{B}_n^k$…

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…

For any real $\alpha \in [0,1]$, Nikiforov defined the $A_\alpha$-matrix of a graph $G$ as $A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the diagonal matrix of vertex degrees of $G$,…

The harmonic index of a graph $G$, is defined as the sum of weights $\frac{2}{d(u)+d(v)}$ of all edges $uv$ of $G$, where $d(u)$ is the degree of the vertex $u$ in $G$. In this paper we find the minimum harmonic index of bicyclic graph of…

Let $I(G)$ be a topological index of a graph. If $I(G+e)<I(G)$ (or $I(G+e)>I(G)$, respectively) for each edge $e\not\in G$, then $I(G)$ is monotonically decreasing (or increasing, respectively) with the addition of edges. In this article,…

Introduced by Gutman in 2021, the Sombor index is a novel graph-theoretic topological descriptor possessing potential applications in the modeling of thermodynamic properties of compounds. Let G^k_n be the set of all n-vertex connected…

The edge-connectivity of a graph is the minimum number of edges whose deletion disconnects the graph. Let $\Delta(G)$ the maximum degree of a graph $G$ and let $\rho(G)$ be the spectral radius of $G$. In this article we present a lower…

In this note we obtain a new bound for the acyclic edge chromatic number $a'(G)$ of a graph $G$ with maximum degree $D$ proving that $a'(G)\leq 3.569(D-1)$. To get this result we revisit and slightly modify the method described in [Giotis,…

Let $D=(V,A)$ be a digraphs without isolated vertices. The first Zagreb index of a digraph $D$ defined as a summation over all arcs, $M_1(D)=\frac{1}{2}\sum\limits_{uv\in A}(d^{+}_{u}+d^{-}_v)$, where $d^{+}_u$(resp. $d^{-}_u$) denotes the…

In this paper, we focus on the index ( largest eigenvalue) of the adjacency matrix of connected signed graphs. We give some general results on the index when the corresponding signed graph is perturbed. As applications, we determine the…