97 search results - page 1 / 20 » Cycles, Paths, Connectivity and Diameter in Distance Graphs |
WG
2009
Springer
13 years 9 months ago
2009
Springer
DAM
2011
13 years 7 days ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
TCS
2010
13 years 3 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
COMBINATORICS
2000
13 years 5 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
DM
2010
13 years 5 months ago
2010
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...