Open AccessMonochromatic and rainbow 4-connectivity of moon graphs
Author(s) -
M. A. Shulhany,
Dimas K. N. Rachim,
Yazid Rukmayadi
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/673/1/012058
Subject(s) - monochromatic color , rainbow , password , graph , computer science , connectivity , object (grammar) , combinatorics , mathematics , physics , optics , computer security , artificial intelligence
Monochromatic and rainbow connectivity are known as the concepts that can calculate the minimum number of passwords and security systems. In this paper, a security system is represented by a special mathematics object, namely a graph. The study focuses on the moon graphs or Mon. Moon graphs are chosen because it is one of the 4-connected graphs that has a minimum number of edges. The research method used is mathematical modeling equipped with direct proves and contradictions. The conclusion is that there is an efficiency of 75% when using the monochromatic connected number, and there is an efficiency between 62.5% - 75% when using the rainbow 4-connected number.