Related papers: Geometric-Arithmetic index and line graph
Algebraic statistics is concerned with the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry. This article presents a list of open mathematical problems in this emerging field,…
The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…
We present a refinement, by selfimprovement, of the arithmetic geometric inequality.
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
The hyper Zagreb index is a kind of extensions of Zagreb index, used for predicting physicochemical properties of organic compounds. Given a graph $G= (V(G), E(G))$, the first hyper-Zagreb index is the sum of the square of edge degree over…
In this paper, we present a series of techniques to describe General Relativity using Geometric Algebra (GA). We emphasize the physical interpretation of quantities and provide a step-by-step guide for performing calculations. In doing so,…
Due to their capacity to encode rich structural information, labeled graphs are often used for modeling various kinds of objects such as images, molecules, and chemical compounds. If pattern recognition problems such as clustering and…
We introduce \textcolor{red}{general} new techniques for computing the geometric index of a link $L$ in the interior of a solid torus $T$. These techniques simplify and unify previous ad hoc methods used to compute the geometric index in…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
In this paper we will show that the Gini coefficient and the introduced measure of angular inequality are special cases of a wider indexed family of measurements. We will discuss the properties of the defined class based, inter alia, on a…
This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…
In this paper, we introduce the concept of complementary edge ideals of graphs and study their algebraic properties and invariants.
This paper is devoted to a systematic study of certain geometric integral inequalities which arise in continuum combinatorial approaches to $L^p$-improving inequalities for Radon-like transforms over polynomial submanifolds of intermediate…
Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line…
The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…
The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
Graphs are nowadays ubiquitous in the fields of signal processing and machine learning. As a tool used to express relationships between objects, graphs can be deployed to various ends: I) clustering of vertices, II) semi-supervised…