Related papers: The lattice of cycles of an undirected graph
A method for successive synthesis of the Weyl matrix on the square lattice is proposed. It allows one to compute the Weyl matrix of a large graph by adding new edges and solving elementary systems of linear algebraic equations at each step.…
The fundamental group of the complement of a plane curve is a very important topological invariant. In particular, it is interesting to find out whether this group is determined by the combinatorics of the curve or not, and whether it is a…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
In this paper, we show some applications to algebraic cycles by using higher Abel-Jacobi maps which were defined in [the author: Motives and algebraic de Rham cohomology]. In particular, we prove that the Beilinson conjecture on algebraic…
Let $L$ be a set of positive integers. We call a (directed) graph $G$ an $L$\emph{-cycle graph} if all cycle lengths in $G$ belong to $L$. Let $c(L,n)$ be the maximum number of cycles possible in an $n$-vertex $L$-cycle graph (we use…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
In this paper we are defining a special class of graphs called multilayered graphs and its subclass, multilayered cycles. For that subclass of graphs we are giving the values of all vertex spans (strong, direct, or Cartesian span).…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…
Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its "spine". The chordless cycles which comprise this irreducible core effectively characterize the…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in…
Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geodetic topological circles. We further show that, although the finite cycles of G generate C(G), its finite geodetic cycles need not generate…
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…
In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…