Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only central ...

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].

The easiest way to disprove the Graph Reconstruction Conjecture would be to find two seperate graphs that produce the same deck. We looked at these possibilities by examining Kocay graphs which shared ...

Abstract: The combination of cubic fuzzy graphs and fuzzy graph structures, the cubic fuzzy graph structure specializes for handling complicated issues, particularly those involving many interactions.