Results 11 to 20 of about 138,741 (178)
Novel Neutrosophic Cubic Graphs Structures With Application in Decision Making Problems
IEEE Access, 2019 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 neutrosophic cubic graphs.
Muhammad Gulistan +4 more
doaj +3 more sources
PLoS ONEFuzzy graphs are very important when we are trying to understand and study complex systems with uncertain and not exact information. Among different types of fuzzy graphs, cubic fuzzy graphs are special due to their ability to represent the membership ...
Xiaolong Shi +4 more
doaj +3 more sources
A Novel Study of Graphs Based on m-Polar Cubic Structures
Journal of Function Spaces, 2022 By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin +4 more
doaj +1 more source
Cubic Pythagorean Fuzzy Graphs
Journal of Mathematics, 2022 The purpose of the study is to explore graph theory based on cubic Pythagorean fuzzy sets. The concept of cubic Pythagorean fuzzy graphs (CuPFGs) is introduced in this research work.
G. Muhiuddin +3 more
doaj +1 more source
Isomorphic bisections of cubic graphs [PDF]
Journal of Combinatorial Theory, Series B, 2021 Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured that the vertices of every cubic graph can be partitioned into two parts that induce isomorphic subgraphs.
Das, S, Pokrovskiy, A, Sudakov, B
openaire +3 more sources
Detection number of bipartite graphs and cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 For a connected graph G of order |V(G)| ≥3 and a k-labelling c : E(G) →{1,2,…,k} of the edges of G, the code of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are labelled i. The k-labelling c is
Frederic Havet +2 more
doaj +1 more source
Coverings of Cubic Graphs and 3-Edge Colorability
Discussiones Mathematicae Graph Theory, 2021 Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and
Plachta Leonid
doaj +1 more source
The Cost of Perfection for Matchings in Graphs [PDF]
, 2014 Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching.
Brazil, Emilio Vital +3 more
core +1 more source
On 2-power unicyclic cubic graphs
Electronic Journal of Graph Theory and Applications, 2022 In a graph, a cycle whose length is a power of two (that is, 2k) is called a 2-power cycle. In this paper, we show that the existence of an infinite family of cubic graphs which contain only one cycle whose length is a power of 2.
Shariefuddin Pirzada +2 more
doaj +1 more source
Random Structures & Algorithms, 2006 AbstractWe show that the number of labeled cubic planar graphs on n vertices with n even is asymptotically αn−7/2ρ−nn!, where ρ−1 ≐ 3.13259 and α are analytic constants. We show also that the chromatic number of a random cubic planar graph that is chosen uniformly at random among all the labeled cubic planar graphs on n vertices is three with ...
Bodirsky, M +3 more
openaire +2 more sources