References

[1] ?. Graph Theory. URL:http://compalg.inf.elte.hu/~tony/Oktatas/TDK/FINAL/Chap%203.PDF.

[2] K. Shekhawat, Pinki, and J. P. Duarte. A graph theoretical approach for creating building floor plans. In J.-H. Lee, editor, Computer-Aided Architectural Design. “Hello, Culture” , pages 3–14, Singapore, 2019. Springer Singapore.

[3] P. T. (https://math.stackexchange.com/users/357390/parcly-taxel). Proving that in a simple graph with n vertices, two vertices have the same degree. Mathematics Stack Exchange. URL:https://math.stackexchange.com/q/2690153 (version: 2021-01-16).

[4] N. (https://math.stackexchange.com/users/468922/norman). How to prove two graphs are isomorphic if and only if their complements are isomorphic? Mathematics Stack Exchange. URL:https://math.stackexchange.com/q/2451171 (version: 2017-09-30).

[5] C. E. (https://math.stackexchange.com/users/5203/chris-eagle). Given a simple graph and its complement, prove that either of them is always connected. Mathematics Stack Exchange. URL:https://math.stackexchange.com/q/122188 (version: 2012-03-19).

[6] D. (https://math.stackexchange.com/users/718230/dododuquercy). Under what condition is a complete bipartite graph km,n a regular graph. Mathematics Stack Exchange. URL:https://math.stackexchange.com/q/3733224 (version: 2020-06-24).

[7] A. T. (https://www.quora.com/profile/Amitabha-Tripathi). What is proof for any simple graph if there exist at least two vertices that have the same degree? Quora. https://www.quora.com/What-is-proof-for-any-simple-graph-if-there-exist-at-least-two-vertices-that-have-the-same-degree/answers/202585439 (version: 2020-03-20).