Cubic Planar Graph and Its Application to Road Network

Abstract

In this research article, we present the notion of a cubic planar graph and investigate its related properties. The cubic graphs are more effective than both interval-valued and fuzzy graphs as it represents the level of participation (membership degree) of vertices and edges both in interval form and as a fuzzy number. Moreover, it handles the uncertainty and vagueness more efficiently than both interval-valued fuzzy graph and fuzzy graph. The interval indicates a continuous process, whereas the point indicates a specific process. We introduce the terms cubic multigraph, cubic strong and weak edges, and degree of planarity for cubic planar graphs. Some fundamental theorems based on these concepts are also elaborated. We also propose the idea of a cubic strong and weak fuzzy faces and cubic dual graph. Some results related to these concepts are also established. Comparison with the existing method shows the worth of our proposed work.