z-logo
open-access-imgOpen Access
Algorithm On Complete Graph And Their Folding
Author(s) -
H. Ahmed
Publication year - 2021
Publication title -
türk bilgisayar ve matematik eğitimi dergisi
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.218
H-Index - 3
ISSN - 1309-4653
DOI - 10.17762/turcomat.v12i6.2418
Subject(s) - folding (dsp implementation) , graph , computer science , algorithm , mathematics , theoretical computer science , combinatorics , engineering , electrical engineering
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here