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

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 combination of cubic fuzzy graphs and fuzzy graph structures, the cubic fuzzy graph structure specializes for handling complicated issues, particularly those involving many interactions. This type ...

In this paper, we present matrix game-theoretic models for joint routing, network coding, and scheduling problems. First, routing and network coding are modeled by using a new approach based on a ...