Related papers: Projective Rectangles: The Graph of Lines
We present pictorial means of distinguishing contravariant vectors (or simply vectors) from covariant vectors (or linear forms). When one depicts vector as the directed segment, then the pictorial image of a linear form is a family of…
A rectangular graphyne sheet is composed of units similar to phenyl rings that are linked by acetylenic chains, as in hexagonal $\gamma$-graphyne. This system is organized over a rectangular lattice similar to that of the recently…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
We describe weighted projective lines in the sense of Geigle and Lenzing by a moduli problem on the canonical algebra of Ringel. We then go on to study generators of the derived categories of coherent sheaves on the total spaces of their…
Given a real vector space V of finite dimension, together with a particular homogeneous field of bivectors that we call a "field of projective forces", we define a law of dynamics such that the position of the particle is a "ray" i.e. a…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
A rectangular dual of a plane graph $G$ is a contact representations of $G$ by interior-disjoint axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the union of all rectangles is a rectangle. A rectangular dual…
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape $C$, a constrained Delaunay graph is constructed by adding…
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…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
We show that there are five types of planar curves such that arrangements of its translates are combinatorially equivalent to an arrangement of lines. These curves can be used to define norms giving constructions with many unit distances…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
A plane graph is said to be a rectangular graph if each of its edges can be oriented horizontal or vertical, its internal regions are four-sided and it has a rectangular enclosure. If dual of a planar graph is a rectangular graph, then the…
In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…
A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.