Sign in
Highly non-concurrent longest paths in lattices
Journal article   Peer reviewed

Highly non-concurrent longest paths in lattices

Yasir Bashir, Faisal Nadeem and Ayesha Shabbir
Turkish journal of mathematics, Vol.40(1), pp.21-31
01/01/2016

Abstract

Mathematics Physical Sciences Science & Technology
In this paper we consider graphs in which any pair of vertices is missed by some longest path. We are proving the existence of such graphs in the infinite triangular, square and hexagonal lattices in the plane. Moreover, we extend our investigation to lattices on several surfaces such as the torus, the Mobius strip and the Klein bottle.

Metrics

1 Record Views

Details