Algorithm On Complete Graph And Their Folding
Main Article Content
Abstract
In this paper, introduce algorithm on complete graph K4, when the graph weighted, and discusses the folding of algorithm graph of weighted complete graph K4, the folding at some cases such as folding of the edges as all cases, and folding of the vertices, some theorems related to these result are obtained and prove of this theorems are obtained, also some life applications are introduced.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.