Results 221 to 230 of about 115,450 (267)

Equimatchable Regular Graphs

Journal of Graph Theory, 2017
AbstractA graph is called equimatchable if all of its maximal matchings have the same size. Kawarabayashi, Plummer, and Saito showed that the only connected equimatchable 3‐regular graphs are K4 and K3, 3. We extend this result by showing that for an odd positive integer r, if G is a connected equimatchable r‐regular graph, then .
Akbari, Saieed   +3 more
openaire   +1 more source

Regular two-graphs from strongly regular graphs

2022
In this talk we will give a classification of strongly regular graphs with parameters (41, 20, 9, 10) that have a nontrivial automorphism. We will talk about the construction of regular two-graphs with 42 vertices from these strongly regular graphs and about the construction of regular two-graphs with 38 vertices.
Maksimović, Marija, Rukavina, Sanja
openaire  

Home - About - Disclaimer - Privacy