On the connectivity and restricted edge-connectivity of 3-arc graphs
From MaRDI portal
Publication:741721
DOI10.1016/j.dam.2013.08.010zbMath1300.05150OpenAlexW1991000777MaRDI QIDQ741721
Luis Pedro Montejano, Pedro García-Vázquez, Camino Balbuena
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2099/10351
Related Items (4)
Hadwiger's conjecture for 3-arc graphs ⋮ Hamiltonicity of 3-arc graphs ⋮ Three-arc graphs: characterization and domination ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- A study of 3-arc graphs
- Super \(p\)-restricted edge connectivity of line graphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- On reliability of the folded hypercubes
- On the connectivity and superconnected graphs with small diameter
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- Diameter and connectivity of 3-arc graphs
- On computing a conditional edge-connectivity of a graph
- Super edge-connectivity of dense digraphs and graphs
- Imprimitive symmetric graphs, 3-arc graphs and 1-designs
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Path graphs
- A class of finite symmetric graphs with 2-arc transitive quotients
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Connectivity of iterated line graphs
This page was built for publication: On the connectivity and restricted edge-connectivity of 3-arc graphs
