期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2004
卷号：2004
DOI：10.1155/S0161171204306058
出版社：Hindawi Publishing Corporation
摘要：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
