Related papers: Geometric-Arithmetic index and line graph
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
A finite, simple and undirected graph $G = (V, E)$ with $p$ vertices and $q$ edges is said to be a $k$-geometric mean graph for a positive integer $k$ if there is an injection $\psi :V(G)\to \{k,k+1,\dots,k+q\}$ such that, when each edge…
Many scientific problems require to process data in the form of geometric graphs. Unlike generic graph data, geometric graphs exhibit symmetries of translations, rotations, and/or reflections. Researchers have leveraged such inductive bias…
Introduced by Gutman in 2021, the Sombor index is a novel graph-theoretic topological descriptor possessing potential applications in the modeling of thermodynamic properties of compounds. Let G^k_n be the set of all n-vertex connected…
Motivated by the recently introduced topological index, the Somber index, we define a new topological index of a graph in this paper, we call it Sombor coindex. The Sombor coindex is defined by considering analogous contributions from the…
The aim of this paper is to obtain new inequalities for a large family of generalizations of the Wiener Index and to characterize the set of extremal graphs with respect to them. Our main results provide upper and lower bounds for these…
In this paper we consider a new kind of inequality related to fractional integration, motivated by Gressman's paper. Based on it we investigate its multilinear analogue inequalities. Combining with the Gressman's work on multilinear…
In chemical graph theory, topological indices are widely used as numerical descriptors for establishing quantitative structure-property relationships (QSPR) and quantitative structure-activity relationships (QSAR). These indices…
Frank Harary introduced the concepts of sum and integral sum graphs. A graph $G$ is a \textit{sum graph} if the vertices of $G$ can be labeled with distinct positive integers so that $e = uv$ is an edge of $G$ if and only if the sum of the…
Integrated Gradients (IG) is a common explainability technique to address the black-box problem of neural networks. Integrated gradients assumes continuous data. Graphs are discrete structures making IG ill-suited to graphs. In this work,…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
By defining grids as graphs, geometric graphs can be represented in a very concise way.
Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…
In this paper, we establish several new inequalities for some differantiable mappings that are connected with the celebrated Hermite-Hadamard integral inequality. Some applications for special means of real numbers are also provided.
Geospatial sciences include a wide range of applications, from environmental monitoring transportation to infrastructure planning, as well as location-based analysis and services. Graph theory algorithms in mathematics have emerged as…
The arithmetic mean is the mean for addition and the geometric mean is that for multiplication. Then what kind of binary operation is associated with the arithmetic-geometric mean (AGM) due to C. F. Gauss? If it is possible to construct an…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them…