Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the connectivity and restricted edge-connectivity of 3-arc graphs

Autor
Balbuena, C.; García, P.; Montejano , L.P.
Tipus d'activitat
Article en revista
Revista
Discrete applied mathematics
Data de publicació
2014-01-10
Volum
162
Pàgina inicial
90
Pàgina final
99
DOI
https://doi.org/10.1016/j.dam.2013.08.010 Obrir en finestra nova
URL
https://vpn.upc.edu/science/article/pii/,DanaInfo=www.sciencedirect.com+S0166218X1300351X Obrir en finestra nova
Resum
Let View the MathML source 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 graphX(G) of a given graph G is defined to have vertices the arcs of View the MathML source, and they are denoted as (uv). Two vertices (ay),(bx) are adjacent in X(G) if and only if (y,a,b,x) is a 3-arc of G. The purpose of this work is to study the edge-connectivity and restricted edge-connectivity of 3-arc grap...
Paraules clau
Graph theory Mathematical techniques
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants