Buscar
Mostrando ítems 1-1 de 1
Artículo
On the connectivity and restricted edge-connectivity of 3-arc graphs
(Elsevier, 2014-01-10)
A 3 − arc of a graph G is a 4-tuple (y, a, b, x) of vertices such that both (y, a, b) and (a, b, x) are paths of length two in G. Let ←→G denote the symmetric digraph of a graph G. The 3-arc graph X(G) of a given graph ...