This definitely does not work for any number of vertex k and any number of degree n. For example k=5 and n=3.
But how about other combinations?
This definitely does not work for any number of vertex k and any number of degree n. For example k=5 and n=3.
But how about other combinations?
Copyright © 2021 JogjaFile Inc.
I found the answer here: https://en.m.wikipedia.org/wiki/Handshaking_lemma https://en.m.wikipedia.org/wiki/Regular_graph Thanks to Thomas Preu