Title of article :
Highly nonconcurrent longest paths and cycles in lattices
Author/Authors :
BASHIR, YASIR GC University - Abdus Salam School of Mathematical Sciences, Pakistan
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 L^n where L denotes the set of integers.
Keywords :
Longest cycles , longest paths , n , dimensional lattices , Gallai’s property
Journal title :
Turkish Journal of Mathematics
Journal title :
Turkish Journal of Mathematics
