Results 11 to 20 of about 26,192 (266)
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Isomorphic bisections of cubic graphs [PDF]
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
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular.
Shangjing Hao, Shixun Lin
doaj +1 more source
Cubic semisymmetric graphs of order $ 40p $ [PDF]
A simple graph $\Gamma$ is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. A simple graph $\Gamma$ is called cubic whenever it is $ 3 $-regular.
Mohammad Reza Salarian +1 more
doaj +1 more source
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
Novel Neutrosophic Cubic Graphs Structures With Application in Decision Making Problems
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 +1 more source
Hypercube is a popular interconnection network. Due to the popularity of hypercube, more researchers pay a great effort to develop the different variants of hypercube.
Burhan Selçuk, Ali Karci
doaj +1 more source
Graphical Structures of Cubic Intuitionistic Fuzzy Information
The theory developed in this article is based on graphs of cubic intuitionistic fuzzy sets (CIFS) called cubic intuitionistic fuzzy graphs (CIFGs). This graph generalizes the structures of fuzzy graph (FG), intuitionistic fuzzy graph (IFG), and interval ...
Sami Ullah Khan +3 more
doaj +1 more source
Summary: We introduce certain concepts, including cubic graphs, internal cubic graphs, external cubic graphs, and illustrate these concepts by examples. We deal with fundamental operations, Cartesian product, composition, union and join of cubic graphs. We discuss some results of internal cubic graphs and external cubic graphs.
Sheikh Rashid +3 more
openaire +6 more sources
The cubic power graph of finite abelian groups
Let G be a finite abelian group with identity 0. For an integer the additive power graph of G is the simple undirected graph with vertex set G in which two distinct vertices x and y are adjacent if and only if x + y = nt for some with When the additive ...
R. Raveendra Prathap, T. Tamizh Chelvam
doaj +1 more source

