Related papers: On the Discrepancy Between Two Zagreb Indices
The total $\sigma$-irregularity is given by $ \sigma_t(G) = \sum_{\{u,v\} \subseteq V(G)} \left(d_G(u) - d_G(v)\right)^2, $ where $d_G(z)$ indicates the degree of a vertex $z$ within the graph $G$. It is known that the graphs maximizing…
The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman…
In a strong edge-coloring of a graph $G=(V,E)$, any two edges of distance at most $2$ get distinct colors. The strong chromatic index of $G$, denoted by $\chi_s'(G)$, is the minimum number of colors needed in a strong edge-coloring of $G$.…
Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$…
Topological indices are numerical invariants derived from molecular graphs and play an important role in characterizing chemical compounds and predicting their properties. Among the earliest descriptors are the classical Zagreb indices…
The aim of this work is to obtain new inequalities for the variable symmetric division deg index $SDD_\alpha(G) = \sum_{uv \in E(G)} (d_u^\alpha/d_v^\alpha+d_v^\alpha/d_u^\alpha)$, and to characterize graphs extremal with respect to them.…
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…
For a connected graph $G$ with order $n$ and an integer $k\geq 1$, we denote by $$S_k(D(G))=\lambda_1(D(G))+\cdots+\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and…
Do\v{s}li\'{c} et al.~defined the Mostar index of a graph $G$ as $\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 $G$ to…
Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).
We consider topological indices I that are sums of f(deg(u)) f(deg(v)), where {u,v} are adjacent vertices and f is a function. The Randi{\'c} connectivity index or the Zagreb group index are examples for indices of this kind. In earlier…
This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…
The Wiener index $W(G)$ of a graph $G$ is one of the most well-known topological indices, which is defined as the sum of distances between all pairs of vertices of $G$. The diameter $D(G)$ of $G$ is the maximum distance between all pairs of…
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…
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…
The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard…
A $k$-edge-weighting of $G$ is a mapping $\omega:E(G)\longrightarrow \{1,\ldots,k\}$. The edge-weighting of $G$ naturally induces a vertex-colouring $\sigma_{\omega}:V(G)\longrightarrow \mathbb{N}$ given by$\sigma_{\omega}(v)=\sum_{u\in…
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…
The strong chromatic index of a graph $G$, denoted $\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted…
Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating…