New Concepts of Vertex Covering in Cubic Graphs with Its Applications

Abstract

Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems. The cubic graph, which has recently gained a position in the fuzzy graph family, has shown good capabilities when faced with problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Simultaneous application of fuzzy and interval-valued fuzzy membership indicates a high flexibility in modeling uncertainty issues. The vertex cover is a fundamental issue in graph theory that has wide application in the real world. The previous definition limitations in the vertex covering of fuzzy graphs has directed us to offer new classifications in terms of cubic graph. In this study, we introduced the strong vertex covering and independent vertex covering in a cubic graph with strong edges and described some of its properties. One of the motives of this research was to examine the changes in the strong vertex covering number of a cubic graph if one vertex is omitted. This issue can play a decisive role in covering the graph vertices. Since many of the problems ahead are of hybrid type, by reviewing some operations on the cubic graph we were able to determine the strong vertex covering number on the most important cubic product operations. Finally, two applications of strong vertex covering and strong vertex independence are presented.

A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications

“…Furthermore, Muhiuddin et al [39] offered a revised definition of a 𝒞ℱ𝒢, along with concepts concerning strong edges, paths, path strength, bridges, and cut vertices. Rashmanlou et al [40,41] discussed some principles of 𝒞ℱ𝒢s. Rao et al [42] investigated the maximal product in cubic fuzzy graph structures.…”

A Study on Interval‐Valued Fuzzy Graph with Application in Energy Industry Management

“…Jiang et al [10] introduced a new notion of vertex covering in cubic graphs. Turksen [11] de ned IVFSs based on normal forms.…”