Existence of connected regular and nearly regular graphs
Ganesan, Ghurumuruhan
Original · EN
For integers k ≥ 2 and n ≥ k+1, we prove the following: If n· k is even, there is a connected k-regular graph on n vertices. If n· k is odd, there is a connected nearly k-regular graph on n vertices.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.