Results 71 to 80 of about 138,741 (178)
Cubic Cayley Graphs and Snarks
, 2014 The well-known conjecture that there are no snarks amongst Cayley graphs is considered. Combining the theory of Cayley maps with the existence of certain kinds of independent sets of vertices in arc-transitive graphs, some new partial results are obtained suggesting promising future research directions in regards to this conjecture.
Kutnar, Klavdija +2 more
openaire +2 more sources
Circumference of 3-connected cubic graphs
, 2017 The circumference of a graph is the length of its longest cycles. Jackson established a conjecture of Bondy by showing that the circumference of a 3-connected cubic graph of order $n$ is $\Omega(n^{0.694})$.
Liu, Qinghai, Yu, Xingxing, Zhang, Zhao
core +1 more source
The Graph Curvature Calculator and the curvatures of cubic graphs
, 2017 We classify all cubic graphs with either non-negative Ollivier-Ricci curvature or non-negative Bakry-\'Emery curvature everywhere. We show in both curvature notions that the non-negatively curved graphs are the prism graphs and the M\"obius ladders.
Cushing, David +4 more
core
Cubic graphs with large circumference deficit [PDF]
, 2013 The circumference $c(G)$ of a graph $G$ is the length of a longest cycle. By exploiting our recent results on resistance of snarks, we construct infinite classes of cyclically $4$-, $5$- and $6$-edge-connected cubic graphs with circumference ratio $c(G)/|
Mazák, Ján, Máčajová, Edita
core
Decomposing plane cubic graphs
European Journal of Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenta Ozeki, Dong Ye
openaire +2 more sources
On the skewness of the generalized Heawood graphs
AKCE International Journal of Graphs and CombinatoricsBy the skewness of a graph, we mean the minimum number of its edges whose deletion results in a planar graph. We determine the skewness of a large family of cubic bipartite graphs (which includes the Heawood graph as a special case).
Chii Liang Ng +2 more
doaj +1 more source
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. [PDF]
J Graph Theory, 2021 Bagheri Gh B +3 more
europepmc +1 more source
Cubic maximal nontraceable graphs
Discrete Mathematics, 2007 9 pages, 6 ...
Frick, Marietjie, Singleton, Joy
openaire +2 more sources
Generalized connectivity in cubic fuzzy graphs with application in the trade deficit problem
Frontiers in PhysicsCubic fuzzy graphs (CFGs) offer greater utility as compared to interval-valued fuzzy graphs and fuzzy graphs due to their ability to represent the degree of membership for vertices and edges using both interval and fuzzy number forms. The significance of
Yongsheng Rao +3 more
doaj +1 more source
On Independent Domination in Planar Cubic Graphs
Discussiones Mathematicae Graph Theory, 2019 A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +1 more source