Related papers: Finding Structure in Sequences of Real Numbers via…

It is shown that the families of generalized matrix ensembles recently considered which give rise to an orthogonal invariant stable L\'{e}vy ensemble can be generated by the simple procedure of dividing Gaussian matrices by a random…

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…

In the course of studies of the measure of chaos for the distribution of the prime numbers among the positive integers N arched structures have been found. It is given a brief description of the fine structure of the positive integers…

For many graph-related problems, it can be essential to have a set of structurally diverse graphs. For instance, such graphs can be used for testing graph algorithms or their neural approximations. However, to the best of our knowledge, the…

Arithmetical structures on a graph were introduced by Lorenzini as some intersection matrices that arise in the study of degenerating curves in algebraic geometry. In this article we study these arithmetical structures, in particular we are…

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Graph generation is a fundamental problem in various domains, including chemistry and social networks. Recent work has shown that molecular graph generation using recurrent neural networks (RNNs) is advantageous compared to traditional…

In this paper, we consider a structural and geometric property of graphs, namely the presence of large expanders. The problem of finding such structures was first considered by Krivelevich [SIAM J. Disc. Math. 32 1 (2018)]. Here, we show…

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…

Let $\mathbb{G}^{D}$ be the set of graphs $G(V,\, E)$ with $\left|V\right|=n$, and the degree sequence equal to $D=(d_{1},\, d_{2},\,\dots,\, d_{n})$. In addition, for $\frac{1}{2}<a<1$, we define the set of graphs with an almost given…

We construct (k+-1)-regular graphs which provide sequences of expanders by adding or substracting appropriate 1-factors from given sequences of k-regular graphs. We compute numerical examples in a few cases for which the given sequences are…

Graphs are ubiquitous in nature and can therefore serve as models for many practical but also theoretical problems. For this purpose, they can be defined as many different types which suitably reflect the individual contexts of the…

1-planar graphs are graphs that can be drawn in the plane such that any edge intersects with at most one other edge. Ackerman showed that the edges of a 1-planar graph can be partitioned into a planar graph and a forest, and claims that the…

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

In this article, we discuss a novel approach to solving number sequence problems, in which sequences of numbers following unstated rules are given, and missing terms are to be inferred. We develop a methodology of decomposing test sequences…