Related papers: Graph comparison meets Alexandrov
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 paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
Comparison of $1$-dimensional distance functions is a basic tool in Alexandrov geometry and it is used to characterize spaces with curvature bounded above or below. For the zero curvature bound there is a differential inequality which…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…
We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.
Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…
We prove that the criterion for Markov equivalence provided by Zhao et al. (2005) may involve a set of features of a graph that is exponential in the number of vertices.
The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extremal graphs are characterized in this paper. (1)The sum of the…
A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
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…
Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance…
We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…