Results 61 to 70 of about 138,741 (178)
Cyclically five-connected cubic graphs
, 2017 A cubic graph $G$ is cyclically 5-connected if $G$ is simple, 3-connected, has at least 10 vertices and for every set $F$ of edges of size at most four, at most one component of $G\backslash F$ contains circuits.
Aldred +12 more
core +1 more source
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
, 2012 We show that for every cubic graph G with sufficiently large girth there exists a probability distribution on edge-cuts of G such that each edge is in a randomly chosen cut with probability at least 0.88672.
Bollobás +21 more
core +1 more source
Coloring Graphs in Oriented Coloring of Cubic Graphs
Graphs and Combinatorics, 2022 AbstractOriented coloring of an oriented graph G is an arc-preserving homomorphism from G into a tournament H. We say that the graph H is universal for a family of oriented graphs $$\mathcal {C}$$ C if for every $$G\in \mathcal {C}$$ G ∈ C
openaire +2 more sources
On cyclically 4-connected cubic graphs
AKCE International Journal of Graphs and CombinatoricsA 3-connected cubic graph is cyclically 4-connected if it has at least [Formula: see text] vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles.
R. J. Kingan, S. R. Kingan
doaj +1 more source
On Symmetry of Complete Graphs over Quadratic and Cubic Residues
Journal of Chemistry, 2021 In this study, we investigate two graphs, one of which has units of a ring Zn as vertices (or nodes) and an edge will be built between two vertices u and v if and only if u3≡v3mod n. This graph will be termed as cubic residue graph.
M. Haris Mateen +3 more
doaj +1 more source
, 2011 We treat the stationary (cubic) nonlinear Schr\"odinger equation (NSLE) on simplest graphs. Formulation of the problem and exact analytical solutions of NLSE are presented for star graphs consisting of three bonds.
Matrasulov, D. U. +2 more
core +1 more source
A new hypercube variant: Fractal Cubic Network Graph
Engineering Science and Technology, an International Journal, 2015 Hypercube is a popular and more attractive interconnection networks. The attractive properties of hypercube caused the derivation of more variants of hypercube.
Ali Karci, Burhan Selçuk
doaj +1 more source
, 2016 We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning ...
Dvorák, Zdenek +2 more
openaire +4 more sources
, 2019 In this paper, we study hamiltonian cubic graphs and give a necessary and sufficient condition for a bridgeless cubic graph to be ...
Nakanishi, Misa
core
Some snarks are worse than others
, 2020 Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e.
Mazzuoccolo, Giuseppe +3 more
core