Open AccessHighly nonconcurrent longest paths and cycles in lattices
Author(s) -
Yasir Bashir
Publication year - 2014
Publication title -
turkish journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.454
H-Index - 27
eISSN - 1303-6149
pISSN - 1300-0098
DOI - 10.3906/mat-1302-44
Subject(s) - combinatorics , mathematics , property (philosophy) , set (abstract data type) , discrete mathematics , computer science , philosophy , epistemology , programming language
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom