Graphs allow us to study the different patterns of inside the data by making a mental image. The aim of this paper is to develop a neutrosophic cubic graph structure, which is the extension of ...

Conjecture (Berge and Fulkerson): Every 2-connected cubic graph has a collection of six perfect matchings that together cover every edge exactly twice. This conjecture is attributed to Berge in [2].