Related papers: M-polynomial Based Mathematical Formulation of the…

Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let…

In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…

In drug discovery, knowledge of the graph structure of chemical compounds is essential. Many thousands of scientific articles in chemistry and pharmaceutical sciences have investigated chemical compounds, but in cases the details of the…

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…

In this paper, four novel topological indices named as neighbourhood version of forgotten topological index (F_N), modified neighbourhood version of Forgotten topological index ($F_N^*$), neighbourhood version of second Zagreb index…

Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

The Sombor index $SO(G)$ of a graph $G$ is the sum of the edge weights $\sqrt{d^2_G(u)+d^2_G(v)}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of the vertex $u$ in $G$. A connected graph $G = (V ,E)$ is called a quasi-tree,…

Prediction of solubility has been a complex and challenging physiochemical problem that has tremendous implications in the chemical and pharmaceutical industry. Recent advancements in machine learning methods have provided great scope for…

The Hessian Topology is a subject with interesting relations with some classical problems of analysis and geometry. In this article we prove a conjecture on this subject stated by V.I. Arnold concerning the number of connected components of…

A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…

The general Sombor index of $G$ is defined as $SO_{\alpha}(G)= \sum_{uv\in G}\left(d^2_{G}(u)+d^2_{G}(v)\right)^{\alpha}$. For $0<\alpha<1$, we have the upper bound of $SO_{\alpha}(G)$ on unicyclic graphs with a fixed diameter, and the…

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…

A new geometric background of graph invariants was introduced by Gutman, of which the simplest is the second Sombor index $SO_2$, defined as $SO_2=SO_2(G)=\sum_{uv\in E}\frac{|d^2_G(u)-d^2_G(v)|}{d^2_G(u)+d^2_G(v)}$, where $G = (V, E)$ is a…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

Let $G=(V,E)$ be a graph and $e=uv\in E$. Define $n_u(e,G)$ be the number of vertices of $G$ closer to $u$ than to $v$. The number $n_v(e,G)$ can be defined in an analogous way. The Mostar index of $G$ is a new graph invariant defined as…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

The Elliptic Somber and Euler Somber indices are newly defined topological indices based on the Somber index. Our paper presents calculations of the upper and lower bounds of these indices for the join and corona product of arbitrary…