English

Existence of connected regular and nearly regular graphs

Combinatorics 2018-01-26 v1

Abstract

For integers k2k \geq 2 and nk+1n \geq k+1, we prove the following: If nkn\cdot k is even, there is a connected kk-regular graph on nn vertices. If nkn\cdot k is odd, there is a connected nearly kk-regular graph on nn vertices.

Keywords

Cite

@article{arxiv.1801.08345,
  title  = {Existence of connected regular and nearly regular graphs},
  author = {Ghurumuruhan Ganesan},
  journal= {arXiv preprint arXiv:1801.08345},
  year   = {2018}
}
R2 v1 2026-06-22T23:55:46.297Z