Related papers: Average Degree of Graphs Derived From The Ammann A…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Halin graphs constitute an interesting class of planar and polyhedral graphs. A generalized Halin graph is obtained by connecting all leaves of a planar embedding of a tree via a cycle. A Halin graph is a generalized Halin graph having no…
In this paper we study the general affine differential geometry of surfaces in affine space $A^3$. For a regular elliptical surface we define a moving frame of minimal order and get the complete system of differential invariants. As an…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
The paper provides an elementary proof of Kenyon's necessary condition for the existence of a periodic tiling of the plane by squares with given periods. A similar new result on covering both sides of a rectangle by nonoverlaping squares is…
We show that a connected regular $A_2$-crystal (the crystal graph of an irreducible representation of $sl_3$) can be produced from two half-grids by replicating them and glying together in a certain way. Also some extensions and related…
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…
We study the mean curvature flow of graphs both with Neumann boundary conditions and transport terms. We derive boundary gradient estimates for the mean curvature flow. As an application, the existence of the mean curvature flow of graphs…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…