Abstract

Let G denote the symmetric digraph of a graph G . A 3-arc is a 4-tuple ( y , a , b , x ) of vertices such that both ( y , a , b ) and ( a , b , x ) are paths of length 2 in G . The 3-arc graph X ( ...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call