- Turkish Journal of Mathematics
- Vol: 38 Issue: 3
- Highly nonconcurrent longest paths and cycles in lattices
Highly nonconcurrent longest paths and cycles in lattices
Authors : Yasir Bashir
Pages : 375-383
Doi:10.3906/mat-1302-44
View : 6 | Download : 5
Publication Date : 9999-12-31
Article Type : Makaleler
Abstract :We investigate here the connected graphs with the property that any pair of vertices are missed by some longest paths (or cycles), embeddable in n-dimensional lattices Ln where L denotes the set of integers.Keywords : Longest cycles, longest paths, n-dimensional lattices, Gallai's property