Abstract
We investigate here the connected graphs with the property that any pair of ertices are missed by some longest paths (or cycles), embeddable in n-dimensional lattices Ln where L denotes the set of integers. © TÜBITAK.
Author supplied keywords
Cite
CITATION STYLE
APA
Bashir, Y. (2014). Highly nonconcurrent longest paths and cycles in lattices. Turkish Journal of Mathematics, 38(3), 375–383. https://doi.org/10.3906/mat-1302-44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free