![]() ![]() ![]() Next in reviewing the terms of a regular graph which has a 1-factorization and which has a 2-factorization, it starts by discussing the definition and theorem of matching on bipartite graphs, definitions and examples of factorization graphs, then discussing the proof of theorem of regular graphs that have a 1-factor and a regular graph which has a 2-factor. This research begins by discussing the definitions and examples of euler graphs and regular bipartite multigraphs. This research is a qualitative descriptive study using the method of literature study or literature review where a study of books, scientific journals, and other literature languages is carried out relating to factorization on regular graphs. ![]() This research aims to: (1) know the criteria of a graph that has a -factor, (2) know the conditions of a regular graph that has a 1-factorization, (3) know the conditions of a regular graph that has a 2-factorization. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |