|
|||||
|
|
Edge-connectivity and edge-superconnectivity in sequence graphs |
|
| Authors: | C Balbuena |
| Institution: | a Departament de Matemàtica Aplicada III, Universitat Politècnica de Catalunya, Campus Nord, Edifici C2, C/ Jordi Girona 1 i 3, E-08034 Barcelona, Spain b Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, Campus Nord, Edifici C3, C/ Jordi Girona 1 i 3, E-08034 Barcelona, Spain c Departamento de Matemática Aplicada I, Universidad de Sevilla, Avda Reina Mercedes 2, E-41012 Sevilla, Spain |
| Abstract: | Given an integer k?1 and any graph G, the sequence graph Sk(G) is the graph whose set of vertices is the set of all walks of length k in G. Moreover, two vertices of Sk(G) are joined by an edge if and only if their corresponding walks are adjacent in G.In this paper we prove sufficient conditions for a sequence graph Sk(G) to be maximally edge-connected and edge-superconnected depending on the parity of k and on the vertex-connectivity of the original graph G. |
| Keywords: | Edge-connectivity Edge-superconnectivity Line graphs Sequence graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |