Related papers: Arithmetical structures on graphs
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
The main aim of the paper is to give a socle theory for Leavitt path algebras of arbitrary graphs. We use both the desingularization process and combinatorial methods to study Morita invariant properties concerning the socle and to…
We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.
The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an $n$-ary relational algebra, a concatenative single-relational path algebra, and a…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
We introduce and study arithmetic spin structures on elliptic curves. We show that there is a unique isogeny class of elliptic curves over $\F_{p^2}$ which carries a unique arithmetic spin structure and provides a geometric object of weight…
Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…
Finite simple graphs are a playground for classical areas of mathematics. We illustrate this by looking at some theorems. These are slightly enhanced preparation notes for a talk given at the joint AMS meeting of January 16, 2014 in…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
With the advent of the big data, graph are processed in an iterative manner, which incrementally described in the form of graph in big data applications. Most currently, graph processing methods treat the underlying map data as black boxes.…
The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
We review the following subjects: 1. Basic theory on algebraic curves and their moduli space, 2. Schottky uniformization theory of Riemann surfaces, and its extension called arithmetic uniformization theory, 3. Application to these theories…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…