On the edge set of graphs of lattice paths

Steven Klee, Lara Pudwell and Rick Gillman

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-9

Abstract:

This note explores a new family of graphs defined on the set of paths of the m × n lattice. We let each of the paths of the lattice be represented by a vertex, and connect two vertices by an edge if the corresponding paths share more than k steps, where k is a fixed parameter 0 = k = m + n . Each such graph is denoted by G ( m , n , k ) . Two large complete subgraphs of G ( m , n , k ) are described for all values of m , n , and k . The size of the edge set is determined for n = 2 , and a complicated recursive formula is given for the size of the edge set when k = 1 .

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/709624.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/709624.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:709624

DOI: 10.1155/S0161171204306058

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().