English
Related papers

Related papers: New Lower Bounds for the First Variable Zagreb Ind…

200 papers

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…

Combinatorics · Mathematics 2020-09-08 Akbar Ali , Nenad Trinajstić

Topological indices are graph invariants numeric quantities, which are utilized by researchers to analyze a variety of physiochemical aspects of molecules. The goal of developing topological indices is to give each chemical structure a…

Combinatorics · Mathematics 2022-12-09 Sohan Lal , Karnika Sharma , Vijay Kumar Bhat

The Mostar index of a connected graph \(G\) is defined as \[ Mo(G)=\sum_{uv\in E(G)}\bigl|n_u(uv)-n_v(uv)\bigr|, \] where for an edge \(e=uv\), \(n_u(e)\) denotes the number of vertices of \(G\) that are closer to \(u\) than to \(v\). In…

Combinatorics · Mathematics 2026-04-09 Sunilkumar M. Hosamani

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…

Combinatorics · Mathematics 2014-06-03 Nilanjan De , Sk. Md. Abu Nayeem , Anita Pal

For a graph $G$, the Mostar index of $G$ is the sum of $|n_u(e)$ - $n_v(e)|$ over all edges $e=uv$ of $G$, where $n_u(e)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$, and analogously for…

Combinatorics · Mathematics 2024-07-02 Fazal Hayat , Shou-Jun Xu

In a recent article, Nadeem and Siddique used Chebyshev's sum inequality to establish the Zagreb indices inequality $M_1/n\le M_2/m$ for undirected graphs in the case where the degree sequence $(d_i)$ and the degree-sum sequence $(S_i)$ are…

Combinatorics · Mathematics 2023-01-02 Hanjo Täubig

Very recently, the first geometric-arithmetic index $GA$ and arithmetic-geometric index $AG$ were introduced in mathematical chemistry. In the present paper, we first obtain some lower and upper bounds on $AG$ and characterize the extremal…

Combinatorics · Mathematics 2020-10-09 Shu-Yu Cui , Weifan Wang , Gui-Xian Tian , Baoyindureng Wu

Let G be a simple connected molecular graph with vertex set $V(G)$ and edge set $E(G)$. One important modification of classical Zagreb index, called hyper Zagreb index $HM(G)$ is defined as the sum of squares of the degree sum of the…

Discrete Mathematics · Computer Science 2017-03-27 Nilanjan De

For a connected graph $G$ on at least three vertices, the augmented Zagreb index (AZI) of $G$ is defined as $$AZI(G)=\sum_{uv\in E(G)}\left(\frac{d(u)d(v)}{d(u)+d(v)-2}\right)^{3},$$ being a topological index well-correlated with the…

Combinatorics · Mathematics 2022-05-31 Muhuo Liu , Shumei Pang , Francesco Belardo , Akbar Ali

In this paper we establish connections between common neighborhood Laplacian and common neighborhood signless Laplacian energies and the first Zagreb index of a graph $\mathcal{G}$. We introduce the concepts of CNL-hyperenergetic and…

Combinatorics · Mathematics 2024-02-26 Firdous Ee Jannat , Rajat Kanti Nath , Kinkar Chandra Das

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

Combinatorics · Mathematics 2024-04-16 Aryan Esmailpour , Sara Saeedi Madani , Dariush Kiani

Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] defined the matrix Aalpha(G), as a convex combination of A(G) and D(G), the following way, Aalpha(G) = alpha A(G) + (1 - alpha)D(G), where…

Discrete Mathematics · Computer Science 2023-01-10 João Domingos G. da Silva , Carla Silva Oliveira , Liliana Manuela G. C. da Costa

For a colour cluster $\mathbb{C} =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\ldots,\mathcal{C}_\ell)$, where $\mathcal{C}_i$ is a colour class such that $|\mathcal{C}_i|=r_i$, a positive integer, we investigate two types of simple…

General Mathematics · Mathematics 2017-01-01 Johan Kok , Naduvath Sudev , Muhammad Kamran Jamil

In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…

Probability · Mathematics 2021-02-26 Panpan Zhang , Xiaojing Wang

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

In 2017, Nikiforov introduced the concept of the $A_{\alpha}$-matrix, as a linear convex combination of the adjacency matrix and the degree diagonal matrix of a graph. This matrix has attracted increasing attention in recent years, as it…

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

Combinatorics · Mathematics 2017-04-19 Hanlin Chen , Renfang Wu , Hanyuan Deng

In this paper we compute first and second Zagreb indices of commuting and non-commuting graphs of finite groups and determine several classes of finite groups such that their commuting and non-commuting graphs satisfy Hansen-Vuki\v{c}evi\'c…

Group Theory · Mathematics 2023-04-06 Shrabani Das , Arpita Sarkhel , Rajat Kanti Nath

Recently, D. Vuki$\check{c}$evi$\acute{c}$ and J. Sedlar in \cite{Vuki} introduced an order "$\preceq$" on $\mathcal{T}_n$, the set of trees on $n$ vertices, such that the topological index $F$ of a graph is a function defined on the order…

Combinatorics · Mathematics 2020-10-09 Rui Song , Qiongxiang Huang , Peng Wang

A simple connected graph G is called a p-quasi k-cyclic graph, if there exists a subset S of vertices such that |S|=p, G-S is k-cyclic and there is no a subset S` of V(G) such that |S`|<|S| and G-S` is k-cyclic. The aim of this paper is to…

Combinatorics · Mathematics 2019-10-08 A Ghalavand , A R Ashrafi
‹ Prev 1 3 4 5 6 7 10 Next ›