English
Related papers

Related papers: Mean Sombor index

200 papers

Let $G$ be a simple graph with order $n$ and size $m$. The quantity $M_1(G)=\displaystyle\sum_{i=1}^{n}d^2_{v_i}$ is called the first Zagreb index of $G$, where $d_{v_i}$ is the degree of vertex $v_i$, for all $i=1,2,\dots,n$. The signless…

Combinatorics · Mathematics 2022-05-10 S. Pirzada , Saleem Khan

There are various topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. These topological indices correlate certain physicochemical properties such as…

Combinatorics · Mathematics 2016-05-09 Shaohui Wang , Jia-Bao Liu , Chunxiang Wang , Sakander Hayat

The number of dimer-monomers (matchings) of a graph $G$ is an important graph parameter in statistical physics. Following recent research, we study the asymptotic behavior of the number of dimer-monomers $m(G)$ on the Towers of Hanoi graphs…

Mathematical Physics · Physics 2015-09-30 Hanlin Chen , Renfang Wu , Guihua Huang , Hanyuan Deng

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

Let $G = (V, E)$ be a graph with non-empty set of vertices $V$ and set of edges $E$. The \emph{eccentric connectivity index} of the graph $G$ is defined as $$\displaystyle{\xi^C(G) = \sum_{u \in V} d_u \;ecc(u)}$$ where $d_u$ is the degree…

Combinatorics · Mathematics 2025-09-23 Vysakh Chakooth , Prasanth G. Narasimha-Shenoi , Prakash G. Narasimha-Shenoi

Let $G$ be a simple and finite graph without isolated vertices. In this paper we introduce and study a new degree sequence derived invariant called the \emph{sub-total domination number}, denoted $\sub_t(G)$. In particular, we show that…

Combinatorics · Mathematics 2017-01-30 Randy Davila

Recently, a bond-additive topological descriptor, named as the Mostar index, has been introduced as a measure of peripherality in networks. For a connected graph $G$, the Mostar index is defined as $Mo(G) = \sum_{e=uv \in E(G)} |n_u(e) -…

Combinatorics · Mathematics 2021-03-15 Niko Tratnik

Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that describe various structural properties of a chemical…

Mesoscale and Nanoscale Physics · Physics 2023-01-06 Sohan Lal , Vijay Kumar Bhat , Sahil Sharma

The concepts of geometric-arithmetic and harmonic indices were introduced in the area of chemical graph theory recently. They have proven to correlate well with physical and chemical properties of some molecules. The aim of this paper is to…

Combinatorics · Mathematics 2020-04-08 Walter Carballosa , Ana Granados , Domingo Pestana , Ana Portilla , Jose María Sigarreta

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first…

Combinatorics · Mathematics 2015-03-27 Monica Bianchi , Alessandra Cornaro , José Luis Palacios , Anna Torriero

SmB6 is a strongly correlated material that has been attributed as a topological insulator and a Kondo insulator. Recent studies have found the topological surface states and low temperature insulating character to be profoundly robust…

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

Combinatorics · Mathematics 2025-08-27 Mikhail Isaev , Brendan D. McKay

The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…

Combinatorics · Mathematics 2021-06-23 Sam Spiro

The second Zagreb index is $M_2(G)=\sum_{uv\in E(G)}d_{G}(u)d_{G}(v)$. It was found to occur in certain approximate expressions of the total $\pi$-electron energy of alternant hydrocarbons and used by various researchers in their QSPR and…

Combinatorics · Mathematics 2020-06-17 Mingyao Zeng , Hanyuan Deng

We develop the concept of integral Menger curvature for a large class of nonsmooth surfaces. We prove uniform Ahlfors regularity and a $C^{1,\lambda}$-a-priori bound for surfaces for which this functional is finite. In fact, it turns out…

Classical Analysis and ODEs · Mathematics 2010-12-16 Pawel Strzelecki , Heiko von der Mosel

We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

Probability · Mathematics 2025-03-27 Loïc Gassmann

Let $G=(V(G),E(G))$ be a simple graph with vertex set $V(G)=\{v_{1},v_{2},\cdots, v_{n}\}$ and edge set $E(G)$. The $p$-Sombor matrix $\mathcal{S}_{p}(G)$ of $G$ is the square matrix of order $n$ whose $(i,j)$-entry is equal to…

Combinatorics · Mathematics 2021-11-15 Hechao Liu , Lihua You , Yufei Huang , Xiaona Fang

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

Let $p$ and $q$ be distinct primes. The \textit{semiprime divisor function graph} denoted by $G_{D(pq)}$, is the graph with vertex set $V(G_{D(pq)})=\{1,p,q,pq\}$ and edge set $E(G_{D(pq)})=\{\{1,p\}, \{1,q\},\{1,pq\},\{p,pq\},\{q,pq\}\}$.…

Combinatorics · Mathematics 2021-11-23 John Rafael M. Antalan , Jerwin G. De Leon , Regine P. Dominguez

For a given connected graph $G$, the edge Mostar index $Mo_e(G)$ is defined as $Mo_e(G)=\sum_{e=uv \in E(G)}|m_u(e|G) - m_v(e|G)|$, where $m_u(e|G)$ and $m_v(e|G)$ are respectively, the number of edges of $G$ lying closer to vertex $u$ than…

Combinatorics · Mathematics 2024-05-21 Fazal Hayat , Shou-Jun Xu , Bo Zhou