Related papers: Farey Graphs as Models for Complex Networks
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
This version corrects minor inaccuracies and missprints. One drawing is changed. We continue to study some arithmetical properties of Farey sequences by the method introduced by F.Boca, C.Cobeli and A.Zaharescu (2001). Let $\Phi_{Q}$ be the…
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…
We generalize classical results on the gap distribution (and other fine-scale statistics) for the one-dimensional Farey sequence to arbitrary dimension. This is achieved by exploiting the equidistribution of horospheres in the space of…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
Relational Databases are universally conceived as an advance over their predecessors Network and Hierarchical models. Superior in every querying respect, they turned out to be surprisingly incomplete when modeling transitive dependencies.…
Graph convolution is a fundamental building block for many deep neural networks on graph-structured data. In this paper, we introduce a simple, yet very effective graph convolutional network with skip connections for semi-supervised anomaly…
A family of graphs $\mathcal{F}$ is hereditary if $\mathcal{F}$ is closed under isomorphism and taking induced subgraphs. The speed of $\mathcal{F}$ is the sequence $\{|\mathcal{F}^n|\}_{n \in \mathbb{N}}$, where $\mathcal{F}^n$ denotes the…
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and…
A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We discuss complex Farey graphs for the Euclidean imaginary quadratic number fields $\mathbb Q(\sqrt{-d})$, $d\in\{1, 2, 3, 7, 11\}$. We study hyperbolic versions of A. Schmidt's Farey polygons living in $3$-dimensional hyperbolic space…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We introduce a new approach to constructing networks with realistic features. Our method, in spite of its conceptual simplicity (it has only two parameters) is capable of generating a wide variety of network types with prescribed…
Let A_0, A_1 be nonnegative matrices in GL(n+1,Z) such that the subsimplexes A_0[Delta], A_1[Delta] split the standard unit n-dimensional simplex Delta in two. We prove that, for every n=1,2,... and up to the natural action of the symmetric…
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…
We use a class of Farey graphs introduced by the final three authors to enumerate the tame friezes over $\mathbb{Z}/n\mathbb{Z}$. Using the same strategy we enumerate the tame regular friezes over $\mathbb{Z}/n\mathbb{Z}$, thereby reproving…
With an eye towards studying curve systems on low-complexity surfaces, we introduce and analyze the $k$-Farey graphs $\mathcal{F}_k$ and $\mathcal{F}_{\leqslant k}$, two natural variants of the Farey graph in which we relax the edge…
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…