Related papers: On certain topological indices of graphs

We establish sharp extremal bounds on the Albertson and Sigma irregularity indices for trees with prescribed degree sequences, with emphasis on caterpillar trees as key extremal configurations. New lower and upper bounds are derived in…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of $\sqrt{d_i^2+d_j^2}$, where $d_i$ is the degree of the $i$-th vertex. It has been conceived using geometric…

We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through…

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have…

In this paper, we investigate the Diminished Sombor index (DSO), a recently introduced degree-based topological index for a simple graph $G$, defined as \[ DSO(G) = \sum_{uv \in E} \frac{\sqrt{d_u^2+d_v^2}}{d_u+d_v}, \] where $d_u$ denotes…

In this paper, we investigate the structural properties of trees and bipartite graphs through the lens of topological indices and combinatorial graph theory. We focus on the First and Second Hyper-Zagreb indices, $HM_1(G)$ and $HM_2(G)$,…

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

In this paper, we present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

The Sombor index is a topological index in graph theory defined by Gutman in 2021. In this article we find the maximum Sombor index of unicyclic graphs with a fixed number of pendant vertices. We also provide the unique graph among the…

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a…

Let $G$ be a graph on $n$ vertices and $m$ edges. For $\alpha \in [0,1]$, the $A_{\alpha}$-matrix of $G$ is defined as $A_{\alpha}(G) = \alpha D(G) + (1- \alpha) A(G)$, where $A(G)$ is the adjacency matrix and $D(G)$ is the degree diagonal…

Let $L(G)$ be the set of all subgroups of a group $G$. The subgroup generating bipartite graph $\mathcal{B}(G)$ defined on $G$ is a bipartite graph whose vertex set is the union of two sets $G \times G$ and $L(G)$, and two vertices $(a, b)…

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…

This study explores the irregularity properties of trees with prescribed degree sequences by analyzing two prominent topological indices: the Albertson index and the sigma index. With a particular emphasis on caterpillar trees -frequently…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…