Related papers: Supersingular Isogeny Graphs from Algebraic Modula…
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…
All Cayley representations of the distant graph $\Gamma _Z$ over integers are characterized as Neumann subgroups of the extended modular group. Possible structures of Neumann subgroups are revealed and it is shown that every such a…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
Connection graphs (CGs) extend traditional graph models by coupling network topology with orthogonal transformations, enabling the representation of global geometric consistency. They play a key role in applications such as synchronization,…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
We introduce a tropical version of the Fukaya algebra of a Lagrangian submanifold. Tropical graphs arise as large-scale behavior of pseudoholomorphic disks under a multiple cut operation on a symplectic manifold that produces a collection…
We introduce a concept of isoperimetric dimension for magnetic graphs, that is, graphs where every edge is assigned a complex number of modulus one. In analogy with the classical case, we show that isoperimetric inequalities imply Sobolev…
We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We describe an algorithm that we used to compute the q-expansions of all weight 2 cusp forms of prime level at most 2,000,000 and dimension at most 6. We also present an algorithm that we used to verify that there was only one cusp form of…
Representing a graph as a vector is a challenging task; ideally, the representation should be easily computable and conducive to efficient comparisons among graphs, tailored to the particular data and analytical task at hand. Unfortunately,…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
We address a prime counting problem across the homology classes of a graph, presenting a graph-theoretical Dirichlet-type analogue of the prime number theorem. The main machinery we have developed and employed is a spectral antisymmetry…
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software…
Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing…