English
Related papers

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

200 papers

Recently, Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11-16] defined a new graph invariant which is named the Sombor index $\mathrm{SO}(G)$ of a graph $G$ and is computed via the expression \[ \mathrm{SO}(G) = \sum_{u \sim v}…

Combinatorics · Mathematics 2024-05-24 Ivan Damnjanović , Dragan Stevanović

Let $G$ be a connected graph with $n$ vertices and $m$ edges. The vertex-degree-based topological index (VDB) (or graphical function-index) $TI(G)$ of $G$ with edge-weight function $I(x,y)$ is defined as $$TI(G)=\sum\limits_{uv\in…

General Mathematics · Mathematics 2023-04-25 Hechao Liu , Zenan Du , Yufei Huang , Hanlin Chen , Suresh Elumalai

The hierarchically orthogonal functional decomposition of any measurable function f of a random vector X=(X_1,...,X_p) consists in decomposing f(X) into a sum of increasing dimension functions depending only on a subvector of X. Even when…

Applications · Statistics 2014-05-22 Gaelle Chastaing , Clémentine Prieur , Fabrice Gamboa

Molecular optimization, which transforms a given input molecule X into another Y with desirable properties, is essential in molecular drug discovery. The traditional translating approaches, generating the molecular graphs from scratch by…

Machine Learning · Computer Science 2020-08-17 Chaojie Ji , Yijia Zheng , Ruxin Wang , Yunpeng Cai , Hongyan Wu

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

Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…

Signal Processing · Electrical Eng. & Systems 2025-12-12 Gonzalo Mateos , Yanning Shen , Georgios B. Giannakis , Ananthram Swami

Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…

Combinatorics · Mathematics 2024-08-13 Kinkar Chandra Das , B. R. Rakshith , Wojciech Macek

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Combinatorics · Mathematics 2026-04-07 Xiangshuai Dong , Tingzeng Wu

Topological indices are graph-theoretic descriptors that play a crucial role in mathematical chemistry, capturing the structural characteristics of molecules and enabling the prediction of their physicochemical properties. A widely studied…

Discrete Mathematics · Computer Science 2025-11-26 Sébastien Bonte , Gauvain Devillez , Valentin Dusollier , Alain Hertz , Hadrien Mélot , David Schindl

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boiling point, enthalpy of vaporization, strain energy, and…

Combinatorics · Mathematics 2022-10-05 Haritha T , Chithra A. V.

Recently, the Euler Sombor index $(EUS)$ was introduced as a novel degree-based topological index. For a graph $G$, the Euler Sombor index is defined as $$EUS(G) = \sum_{v_i v_j \in E(G)} \sqrt{d_i^2 + d_j^2 + d_i d_j},$$ where $d_i$ and…

Combinatorics · Mathematics 2025-07-24 Kinkar Chandra Das , Jayanta Bera

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…

Dynamical Systems · Mathematics 2017-06-07 Vladislav Kruglov , Dmitry Malyshev , Olga Pochinka

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

Combinatorics · Mathematics 2010-06-08 J. A. De Loera , C. Hillar , P. N. Malkin , M. Omar

In this paper, we generalize Spencer's hyperbolic cosine algorithm to the matrix-valued setting. We apply the proposed algorithm to several problems by analyzing its computational efficiency under two special cases of matrices; one in which…

Data Structures and Algorithms · Computer Science 2015-03-19 Anastasios Zouzias

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

Dynamical Systems · Mathematics 2023-05-04 Alexander Mundey

Given an integer $k\geq 3$ and an initial $k-1$ isolated vertices, an {\em antiregular $k$-hypergraph} is constructed by alternatively adding an isolated vertex (connected to no other vertices) or a dominating vertex (connected to every…

Combinatorics · Mathematics 2023-03-03 Erchuan Zhang

In the paper we develop new methods for calculating the two well-known topological indices, the degree-distance and the Gutman index. Firstly, we prove that the Wiener index of a double vertex-weighted graph can be computed from the Wiener…

Combinatorics · Mathematics 2019-04-09 Simon Brezovnik , Niko Tratnik

A system of commutative hyperbolic complex numbers in 2 dimensions is studied in this paper. Exponential and trigonometric forms are obtained for these hyperbolic twocomplex numbers. Expressions are given for the elementary functions of…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

Let $R(G)$ be the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and by joining each new vertex to the end vertices of the corresponding edge. Let $RT(G)$ be the graph obtained from $R(G)$ by adding a new…

Combinatorics · Mathematics 2014-11-21 Jia-Bao Liu , Xiang-Feng Pan , Fu-Tao Hu