Edge-connectivity and edge-superconnectivity in sequence graphs
| Autor: | Camino Balbuena, P. García-Vázquez, J. Fíbrega |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
Discrete mathematics
Applied Mathematics Symmetric graph Sequence graphs Distance-regular graph law.invention Combinatorics Vertex-transitive graph law Graph power Line graph Discrete Mathematics and Combinatorics Edge-connectivity Bound graph Graph toughness Edge-superconnectivity Complement graph Mathematics Line graphs |
| Zdroj: | Discrete Applied Mathematics. (16):2053-2060 |
| ISSN: | 0166-218X |
| DOI: | 10.1016/j.dam.2007.05.006 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|