Related papers: M-polynomial Based Mathematical Formulation of the…
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of…
Szeged, PI and Mostar indices are some of the most investigated distance-based molecular descriptors. Recently, many different variations of these topological indices appeared in the literature and sometimes they are all together called…
For a simple connected graph $G=(V,E)$, let $d(u)$ be the degree of the vertex $u$ of $G$. The general Sombor index of $G$ is defined as $$SO_{\alpha}(G)=\sum_{uv\in E} \left[d(u)^2+d(v)^2\right]^\alpha$$ where $SO(G)=SO_{0.5}(G)$ is the…
The forgotten topological index or F-index of a graph is defined as the sum of cubes of the degree of all the vertices of the graph. In this paper we study the F-index of four operations related to the lexicographic product on graphs which…
The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
The set of homogeneous polynomials of degree $D$ is a topological space that contains the subspace $Hyp(D)$ constituted only by hyperbolic polynomials. In 2002, V. I. Arnold conjectured that the number of connected components of $Hyp (D)$…
Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
We outline a rigorous algorithm, first suggested by Casson, for determining whether a closed orientable 3-manifold M is hyperbolic, and to compute the hyperbolic structure, if one exists. The algorithm requires that a procedure has been…
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…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
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…
In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for…
An atom $a$ of a molecular graph $G$ uniquely determines (resolves) a pair $(a_1,a_2)$ of atoms of $G$ if the distance between $a$ and $a_1$ is different from the distance between $a$ and $a_2$. In this paper, we quantify the involvement of…
Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$.…