Results 41 to 50 of about 138,741 (178)
The minimal and maximal energies of all cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained.
Ilhan Hacioglu +2 more
doaj +1 more source
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm [PDF]
, 2018 Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with $t_2$, respectively.
Björklund, Andreas, Husfeldt, Thore
core +3 more sources
Spreading in claw-free cubic graphs [PDF]
Opuscula MathematicaLet \(p \in \mathbb{N}\) and \(q \in \mathbb{N} \cup \lbrace \infty \rbrace\). We study a dynamic coloring of the vertices of a graph \(G\) that starts with an initial subset \(S\) of blue vertices, with all remaining vertices colored white.
Boštjan Brešar +2 more
doaj +1 more source
Max-Leaves Spanning Tree is APX-hard for Cubic Graphs [PDF]
, 2009 We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs).
Bonsma, Paul
core
Fractional colorings of cubic graphs with large girth [PDF]
, 2010 We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n.
Kardos, Frantisek +2 more
core +4 more sources
Cubical graphs and cubical dimensions
Computers & Mathematics with Applications, 1988 A cubical graph G is isomorphic to a subgraph of some hypercube \(Q_ n\). The cubical dimension cd(G) is the smallest such n. The induced cubical dimension icd(G) is the minimum n for which G is an induced subgraph of \(Q_ n\). The determination for a given cubical graph G of the exact values of cd(G) and icd(G) is very difficult.
openaire +1 more source
Structure of the flow and Yamada polynomials of cubic graphs
, 2018 We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero.
Agol, Ian, Krushkal, Vyacheslav
core +1 more source
Bounded‐excess flows in cubic graphs [PDF]
Journal of Graph Theory, 2020 AbstractAn (r, α)‐bounded‐excess flow ((r, α)‐flow) in an orientation of a graph G = (V, E) is an assignment f : E → [1, r−1], such that for every vertex x ∈ V, . E+(x), respectively E−(x), is the set of edges directed from, respectively toward x. Bounded‐excess flows suggest a generalization of Circular nowhere‐zero flows (cnzf), which can be regarded
openaire +3 more sources
On q-Power Cycles in Cubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In the context of a conjecture of Erdős and Gyárfás, we consider, for any q ≥ 2, the existence of q-power cycles (i.e., with length a power of q) in cubic graphs. We exhibit constructions showing that, for every q ≥ 3, there exist arbitrarily large cubic
Bensmail Julien
doaj +1 more source