Related papers: Supersingular Isogeny Graphs from Algebraic Modula…
In this work, for the given adjacency matrix of a graph, we present an algorithm which checks the connectivity of a graph and computes all of its connected components. Also, it is mathematically proved that the algorithm presents all the…
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
We give several algorithms addressing computations of intersections of conjugate subgroups.
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…
We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…
There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…
Mather and Yau showed that an isolated complex hypersurface singularity is completely determined by its moduli algebra. It is shown, for the simple elliptic singularities, how to construct continuous invariants from the moduli algebras and,…
In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Isotopic pairs and their representations are considered in a general framework of the vector superalgebra. Numerous examples of finite-dimensional and infinite-dimensional isotopic pairs are discussed. Several types of their representations…
Generating graphs that are similar to real ones is an open problem, while the similarity notion is quite elusive and hard to formalize. In this paper, we focus on sparse digraphs and propose SDG, an algorithm that aims at generating graphs…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
We generalize two classical formulas for complete intersection curves by introducing the the complete intersection discrepancy of a curve as a correction term. The first is a well-known multiplicity formula in singularity theory, due to…
We investigate the supersymmetry (SUSY) structures for inductor-capacitor circuit networks on a simple regular graph and its line graph. We show that their eigenspectra must coincide (except, possibly, for the highest eigenfrequency) due to…
A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = \alpha A + \beta I + \gamma J + \delta D$ with $\alpha \neq 0$, where $I$ is the identity matrix, $J$ is the all-ones matrix and $D$ is the…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…