Structural properties and labeling of graphs
- Dafik
- Authors: Dafik
- Date: 2007
- Type: Text , Thesis , PhD
- Full Text:
- Description: The complexity in building massive scale parallel processing systems has re- sulted in a growing interest in the study of interconnection networks design. Network design affects the performance, cost, scalability, and availability of parallel computers. Therefore, discovering a good structure of the network is one of the basic issues. From modeling point of view, the structure of networks can be naturally stud- ied in terms of graph theory. Several common desirable features of networks, such as large number of processing elements, good throughput, short data com- munication delay, modularity, good fault tolerance and diameter vulnerability correspond to properties of the underlying graphs of networks, including large number of vertices, small diameter, high connectivity and overall balance (or regularity) of the graph or digraph. The first part of this thesis deals with the issue of interconnection networks ad- dressing system. From graph theory point of view, this issue is mainly related to a graph labeling. We investigate a special family of graph labeling, namely antimagic labeling of a class of disconnected graphs. We present new results in super (a; d)-edge antimagic total labeling for disjoint union of multiple copies of special families of graphs. The second part of this thesis deals with the issue of regularity of digraphs with the number of vertices close to the upper bound, called the Moore bound, which is unobtainable for most values of out-degree and diameter. Regularity of the underlying graph of a network is often considered to be essential since the flow of messages and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element. This means that the in-degree and out-degree of each processing element must be the same or almost the same. Our new results show that digraphs of order two less than Moore bound are either diregular or almost diregular.
- Description: Doctor of Philosophy
- Authors: Dafik
- Date: 2007
- Type: Text , Thesis , PhD
- Full Text:
- Description: The complexity in building massive scale parallel processing systems has re- sulted in a growing interest in the study of interconnection networks design. Network design affects the performance, cost, scalability, and availability of parallel computers. Therefore, discovering a good structure of the network is one of the basic issues. From modeling point of view, the structure of networks can be naturally stud- ied in terms of graph theory. Several common desirable features of networks, such as large number of processing elements, good throughput, short data com- munication delay, modularity, good fault tolerance and diameter vulnerability correspond to properties of the underlying graphs of networks, including large number of vertices, small diameter, high connectivity and overall balance (or regularity) of the graph or digraph. The first part of this thesis deals with the issue of interconnection networks ad- dressing system. From graph theory point of view, this issue is mainly related to a graph labeling. We investigate a special family of graph labeling, namely antimagic labeling of a class of disconnected graphs. We present new results in super (a; d)-edge antimagic total labeling for disjoint union of multiple copies of special families of graphs. The second part of this thesis deals with the issue of regularity of digraphs with the number of vertices close to the upper bound, called the Moore bound, which is unobtainable for most values of out-degree and diameter. Regularity of the underlying graph of a network is often considered to be essential since the flow of messages and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element. This means that the in-degree and out-degree of each processing element must be the same or almost the same. Our new results show that digraphs of order two less than Moore bound are either diregular or almost diregular.
- Description: Doctor of Philosophy
The implementation of Blockchain framework in MOOCs to support a freedom of learning in Indonesia
- Febrinanto, Falih, Dafik, Nisviasari, R.
- Authors: Febrinanto, Falih , Dafik , Nisviasari, R.
- Date: 2021
- Type: Text , Conference paper
- Relation: 4th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2020 Vol. 1836
- Full Text:
- Reviewed:
- Description: A freedom of learning program has been released by the Indonesian Ministry and Culture this year 2020. There are three ways for students to earn their credits, namely take the subject course in face-to-face based class, virtual based class or under Massive Open Online Courses (MOOCs). MOOCs is a model that is developed to help people to learn about certain skills through the online platform, without any limitation in the audience. MOOCs aim to enhance broad collaboration between individuals in creating learning environments that have high scalability and can be accessed by anyone and anywhere. The complexity arises when students undertake a subject course through MOOCs, how to certify the completion of their program in which the certification can be gained easily, and the last how secure the obtained certificate? Blockchain technology can help to improve the quality of MOOCs by providing control of academic records as evidence that someone has completed a learning process on MOOCs. Academic records generated will be stored in one place forever and safely stored in the Blockchain environment. This article will explore how the possible to implement the Blockchain framework in MOOCs to support a freedom of learning in Indonesia. © 2021 Published under licence by IOP Publishing Ltd.
- Authors: Febrinanto, Falih , Dafik , Nisviasari, R.
- Date: 2021
- Type: Text , Conference paper
- Relation: 4th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2020 Vol. 1836
- Full Text:
- Reviewed:
- Description: A freedom of learning program has been released by the Indonesian Ministry and Culture this year 2020. There are three ways for students to earn their credits, namely take the subject course in face-to-face based class, virtual based class or under Massive Open Online Courses (MOOCs). MOOCs is a model that is developed to help people to learn about certain skills through the online platform, without any limitation in the audience. MOOCs aim to enhance broad collaboration between individuals in creating learning environments that have high scalability and can be accessed by anyone and anywhere. The complexity arises when students undertake a subject course through MOOCs, how to certify the completion of their program in which the certification can be gained easily, and the last how secure the obtained certificate? Blockchain technology can help to improve the quality of MOOCs by providing control of academic records as evidence that someone has completed a learning process on MOOCs. Academic records generated will be stored in one place forever and safely stored in the Blockchain environment. This article will explore how the possible to implement the Blockchain framework in MOOCs to support a freedom of learning in Indonesia. © 2021 Published under licence by IOP Publishing Ltd.
- «
- ‹
- 1
- ›
- »