English
Related papers

Related papers: On certain topological indices of graphs

200 papers

Let $G$ be a graph on $n$ vertices and $\lambda_1,\lambda_2,\ldots,\lambda_n$ its eigenvalues. The Estrada index of $G$ is defined as $EE(G)=\sum_{i=1}^n e^{\lambda_i}.$ In this work, using a different demonstration technique, new lower…

Spectral Theory · Mathematics 2019-07-01 Juan L. Aguayo , Juan R. Carmona , Jonnathan Rodríguez

We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…

Spectral Theory · Mathematics 2023-04-14 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…

Combinatorics · Mathematics 2017-03-17 Alvaro Martínez-Pérez , José M. Rodríguez

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…

Combinatorics · Mathematics 2023-04-25 Yunfang Tang , Xuli Qi , Douglas B. West

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…

Combinatorics · Mathematics 2018-03-14 Akbar Ali , Darko Dimitrov

Topological relations between three degree-based invariants of a connected graph G are investigated. We present novel inequalities including M1(G), M2(G) and F(G), and show that in all cases equality holds if G is a regular or a semiregular…

Combinatorics · Mathematics 2015-09-29 Tamás Réti , Imre Felde

Very recently, a bond-additive topological descriptor, known as the Mostar index, has been proposed as a measure of peripherality in graphs and networks. In this article, we compute the Mostar index of corona product, Cartesian product,…

Combinatorics · Mathematics 2020-05-20 Shehnaz Akhter , Zahid Iqbal , Adnan Aslam , Wei Gao

We provide a new upper bound for the energy of graphs in terms of degrees and number of leaves. We apply this formula to study the energy of Erd\"os-R\'enyi graphs and Barabasi-Albert trees.

Combinatorics · Mathematics 2025-02-04 Octavio Arizmendi , Samuel Gurrola-Viramontes

In this paper, we presented a study of topological indices on trees, where we show a relationship with irregularity of Albertson index and minimum, maximum degrees $\delta,\Delta$ of graph $G$, where contribute vital roles in determining…

Combinatorics · Mathematics 2025-11-26 Jasem Hamoud , Artem Kornosov

Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges. The hyper Zagreb index of $G$, denoted by $HM(G)$, is defined as $HM(G) =\sum\limits_{uv \in E(G)}\left[d_{G}(u)+d_G(v)\right]^{2}$ where $d_G(v)$ denotes the degree of a vertex $v$…

Combinatorics · Mathematics 2018-05-30 Chidambaram Natarajan , Selvaraj Balachandran , SK Ayyaswamy

In this paper, we find some bounds for the Sombor index of the graph G by triangle inequality, arithmetic index, geometric index, forgotten index (F(G)), arithmetic-geometric (AG) index, geometric-arithmetic (GA) index, symmetric division…

Combinatorics · Mathematics 2024-09-12 Maryam Mohammadi , Hasan Barzegar

We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…

Spectral Theory · Mathematics 2023-11-01 Chuanyuan Ge , Shiping Liu , Dong Zhang

The distance $d(u,v)$ between the vertices $u$ and $v$ of a connected graph $G$ is defined as the number of edges in a minimal path connecting them. The \emph{transmission} of a vertex $v$ of $G$ is defined by $\sigma(v)=\sum\limits_{u\in…

Combinatorics · Mathematics 2018-09-18 Reza Sharafdini , Tamas Reti

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…

Combinatorics · Mathematics 2022-11-15 Štefko Miklavič , Johannes Pardey , Dieter Rautenbach , Florian Werner

In this paper, we define and obtain several properties of the (adjacency) energy of a hypergraph. In particular, bounds for this energy are obtained as functions of structural and spectral parameters, such as Zagreb index and spectral…

Combinatorics · Mathematics 2021-06-15 Kauê Cardoso , Renata Del-Vecchio , Lucas Portugal , Vilmar Trevisan

In theoretical chemistry molecular structure descriptors are used for modeling physico-chemical, pharmacological, toxicologic, biological and other properties of chemical compounds. In this paper we study distance-based graph invariants and…

Combinatorics · Mathematics 2011-03-15 Aleksandar Ili\' c

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…

Combinatorics · Mathematics 2022-07-01 Sakander Hayat , Ansar Rehman , Yubin Zhong

Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [D. Pacheco, L. de Lima, C. S. Oliveira, On the Graovac-Ghorbani Index for Bicyclic Graph with No Pendent Vertices, MATCH Commun. Math. Comput.…

Combinatorics · Mathematics 2023-08-24 Rui Song , Saihua Liu , Jianping Ou

In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…

Combinatorics · Mathematics 2025-08-07 Jasem Hamoud , Duaa Abdullah

Erd\H{o}s proved an upper bound on the number of edges in an $n$-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph family. F\"{u}redi, Kostochka and Luo showed that these two…

Combinatorics · Mathematics 2025-04-03 Zhanar Berikkyzy , Kirsten Hogenson , Rachel Kirsch , Jessica McDonald