On the edge set of graphs of lattice paths (Q1777851)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the edge set of graphs of lattice paths |
scientific article |
Statements
On the edge set of graphs of lattice paths (English)
0 references
25 May 2005
0 references
Let \(m,n, k\) be positive integers. The authors investigate the structure of families of graphs defined in the following way: the vertices of a graph \(G(m,n,k)\) correspond to the distinct paths in an \(m\times n\) rectangular lattice and two vertices are connected by an edge whenever the corresponding paths share more than \(k\) steps. A characterisation of two large complete subgraphs of \(G(m,n,k)\) and some results for the number of edges of \(G(m,n,k)\) are provided.
0 references
rectangular lattice
0 references
complete graph
0 references