| Autor: |
Štefko Miklavič, Primož Šparl, Dragan Marušič, Klavdija Kutnar |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
Discrete Applied Mathematics. 298:34-49 |
| ISSN: |
0166-218X |
| DOI: |
10.1016/j.dam.2021.03.018 |
| Popis: |
Let l denote a non-negative integer. A connected graph Γ of even order at least 2 l + 2 is l -extendable if it contains a matching of size l and if every such matching is contained in a perfect matching of Γ . A regular graph Γ is co-edge-regular if there exists a constant μ such that any pair of distinct nonadjacent vertices have μ common neighbors. In this paper we classify all 2-extendable and all 3-extendable co-edge-regular graphs of even order. Our results show that the only connected co-edge-regular graph of even order at least 8 and valence at least 7 which is not 3-extendable is the complete multipartite graph K 4 , 4 , 4 . |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect