Sciweavers

DAM
2011
13 years 7 months ago
A study of 3-arc graphs
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 graph ...
Martin Knor, Guangjun Xu, Sanming Zhou
DM
2010
132views more  DM 2010»
14 years 20 days ago
Diameter and connectivity of 3-arc graphs
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 ...
Martin Knor, Sanming Zhou