English
Related papers

Related papers: On bicyclic graphs with maximal Graovac-Ghorbani i…

200 papers

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…

General Mathematics · Mathematics 2020-05-06 Diego Pacheco , Leonardo de Lima , Carla Silva Oliveira

The atom-bond connectivity (ABC) index is a well-known degree-based molecular structure descriptor with a variety of chemical applications. In 2010 Graovac and Ghorbani introduced a distance-based analog of this index, the Graovac-Ghorbani…

Combinatorics · Mathematics 2016-09-07 Darko Dimitrov , Barbara Ikica , Riste Škrekovski

Let $G=(V,E)$ be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as $ABC_{GG}(G)=\sum_{uv\in E(G)}\sqrt{\frac{n_u(uv,G)+n_v(uv,G)-2}{n_u(uv,G)n_v(uv,G)}},$ where $n_u(uv,G)$ is the number of vertices closer to…

Combinatorics · Mathematics 2022-02-07 Nima Ghanbari

The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we…

Combinatorics · Mathematics 2016-08-26 Xiu-Mei Zhang , Yu Yang , Hua Wang , Xiao-Dong Zhang

The atom-bond connectivity (ABC) index is a degree-based molecular structure descriptor that can be used for modelling thermodynamic properties of organic chemical compounds. Motivated by its applicable potential, a series of investigations…

Combinatorics · Mathematics 2016-10-11 Darko Dimitrov , Barbara Ikica , Riste Škrekovski

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…

Combinatorics · Mathematics 2012-02-28 Zhibin Du , Bo Zhou

The atom-bond sum-connectivity (ABS) index of a graph $G$ with edges $e_1,\cdots,e_m$ is the sum of the numbers $\sqrt{1-2(d_{e_i}+2)^{-1}}$ over $1\le i \le m$, where $d_{e_i}$ is the number of edges adjacent with $e_i$. In this paper, we…

General Mathematics · Mathematics 2024-02-27 Tariq Alraqad , Hisham Saber , Akbar Ali , Abeer M. Albalahi

The general sum-connectivity index of a graph $G$ is defined as $\chi_\alpha(G)=\sum\limits_{uv\in E(G)} {(d(u)+d(v))^{\alpha}}$, where $d(v)$ denotes the degree of the vertex $v$ in $G$ and $\alpha$ is a real number. In this paper it is…

Combinatorics · Mathematics 2018-07-13 M. K. Jamil , I. Tomescu

We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we…

Combinatorics · Mathematics 2012-10-19 Zhibin Du , Bo Zhou , Nenad Trinajstic

The Graovac-Pisanski index, also called the modified Wiener index, was introduced in 1991 and represents an extension of the original Wiener index, because it considers beside the distances in a graph also its symmetries. Similarly as…

Combinatorics · Mathematics 2021-10-13 Matevž Črepnjak , Martin Knor , Niko Tratnik , Petra Žigert Pleteršek

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

Combinatorics · Mathematics 2015-03-30 Wei-Gang Yuan , Xiao-Dong Zhang

The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value…

Combinatorics · Mathematics 2015-11-06 Dong Li , Xiang-Feng Pan , Jia-Bao Liu , Hui-Qing Liu

The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the…

Combinatorics · Mathematics 2025-06-11 Hong Zhou , Changjiang Bu

Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…

Combinatorics · Mathematics 2020-04-07 R. Reyes , J. M. Rodriguez , J. M. Sigarreta , M. Villeta

Let $d_u$ be the degree of a vertex $u$ of a graph $G$. The atom-bond sum-connectivity (ABS) index of a graph $G$ is the sum of the numbers $(1-2(d_v+d_w)^{-1})^{1/2}$ over all edges $vw$ of $G$. This paper gives the characterization of the…

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

General Mathematics · Mathematics 2019-05-22 Mehar Ali Malik , Rashid Farooq

The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this invariant for connected chemical graphs of given order and size and characterize the…

For a (molecular) graph, the first multiplicative Zagreb index $\prod_1(G) $ is the product of the square of every vertex degree, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of the products of degrees of pairs of…

Combinatorics · Mathematics 2017-04-25 Shaohui Wang

The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other…

Discrete Mathematics · Computer Science 2024-03-11 Gauvain Devillez , Alain Hertz , Hadrien Mélot , Pierre Hauweele

Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected…

Combinatorics · Mathematics 2025-12-30 Swathi Shetty , B. R. Rakshith , Sayinath Udupa N.
‹ Prev 1 2 3 10 Next ›