Related papers: The difference between several metric dimension gr…
In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…
Graph-level contrastive learning, aiming to learn the representations for each graph by contrasting two augmented graphs, has attracted considerable attention. Previous studies usually simply assume that a graph and its augmented graph as a…
Generalized dimensions of multifractal measures are usually seen as static objects, related to the scaling properties of suitable partition functions, or moments of measures of cells. When these measures are invariant for the flow of a…
Causal discovery aims to recover graphs that represent causal relations among given variables from observations, and new methods are constantly being proposed. Increasingly, the community raises questions about how much progress is made,…
The eccentric connectivity index of a graph $G$ is $\xi^c(G) = \sum_{v \in V(G)}\varepsilon(v)\deg(v)$, and the eccentric distance sum is $\xi^d(G) = \sum_{v \in V(G)}\varepsilon(v)D(v)$, where $\varepsilon(v)$ is the eccentricity of $v$,…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
The magnitude of a metric space is a novel invariant that provides a measure of the 'effective size' of a space across multiple scales, while also capturing numerous geometrical properties, such as curvature, density, or entropy. We develop…
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
In several recent papers, the maximal safety distance that two players can maintain while moving through a graph has been defined and studied using three different spans of the graph, each with different movement conditions. Mainly, vertex…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
In this paper we define a numerical shape invariant of a continuous map called shape dimension of a map, which generalizes the shape dimension of a topological space. Some basic properties and applications of this invariant are given. The…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…
This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree,…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another. It is NP-hard to compute in general, and a…
Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $\varphi$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{\varphi(d_u^+,d_v^-)}$,…