The origami graph, On, n≥3, is a graph formed by a central cycle with origami folds, where each fold consists of two C3 cycles. The barbell origami graph, BOn for n≥3 is obtained by copying a On and connecting two graphs with a bridge. In this research, we determined the partition dimension of the origami graphs and its barbell.
Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics.
IJC is published by the Indonesian ...