Results 1 to 10 of about 26,074 (148)
Decompositions of Cubic Traceable Graphs
A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +2 more sources
The Maximal Product in Cubic Fuzzy Graph Structures with an Application
The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple relationships.
Yongsheng Rao +3 more
doaj +1 more source
Concepts of vertex regularity in cubic fuzzy graph structures with an application
The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple relationships.
Li Li +3 more
doaj +1 more source
On the genera of polyhedral embeddings of cubic graph [PDF]
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given cubic graph and
Gunnar Brinkmann +2 more
doaj +1 more source
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
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.
Huiqin Jiang +4 more
doaj +1 more source
Cubic Graphs and Their Application to a Traffic Flow Problem
A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems.
G. Muhiuddin +3 more
doaj +1 more source
An Even 2-Factor in the Line Graph of a Cubic Graph
An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G.
SeungJae Eom, Kenta Ozeki
doaj +1 more source
Generation of Cubic graphs [PDF]
Discrete Algorithms We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Brinkmann, Gunnar +2 more
openaire +5 more sources
On Semisymmetric Cubic Graphs of Order 20p2, p Prime
A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215–232] that there is no semisymmetric graph of
Shahsavaran Mohsen +1 more
doaj +1 more source
Planarity in cubic intuitionistic graphs and their application to control air traffic on a runway
Fuzzy modeling plays a pivotal role in various fields, including science, engineering, and medicine. In comparison to conventional models, fuzzy models offer enhanced accuracy, adaptability, and resemblance to real-world systems and help researchers to ...
Gang Fang +4 more
doaj +1 more source

