Results 51 to 60 of about 138,741 (178)
On Hamiltonian Cycles in Claw-Free Cubic Graphs
Discussiones Mathematicae Graph Theory, 2022 We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj +1 more source
Chromatic polynomials of complements of bipartite graphs
, 2012 Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic polynomial of an
Bohn, Adam
core +1 more source
Graphs of Acyclic Cubical Complexes
European Journal of Combinatorics, 1996 A cubical complex is a finite set \({\mathfrak K}\) of cubes of any dimensions which is closed under taking subcubes and non-empty intersections. Its vertices are null-dimensional cubes of \({\mathfrak K}\), and it is said to be conformal if any set of vertices is included in a member of \({\mathfrak K}\) whenever each pair of its vertices is contained
Bandelt, Hans-Jürgen, Chepoi, Victor
openaire +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
Hamiltonian decomposition of prisms over cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Special issue PRIMA ...
Moshe Rosenfeld, Ziqing Xiang
doaj +1 more source
Delay Colourings of Cubic Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 In this note we prove the conjecture of Wilfong, Haxell and Winkler (2001) that every bipartite multi-graph with integer edge delays admits an edge colouring with $d+1$ colours in the special case when $d = 3$.
openaire +3 more sources
Asymptotic energy of connected cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and lower
Alper Bulut, Ilhan Hacioglu
doaj +1 more source
On Transmission Irregular Cubic Graphs of an Arbitrary Order
Mathematics, 2022 The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions.
Anatoly Yu. Bezhaev, Andrey A. Dobrynin
doaj +1 more source
Structure of Cubic Lehman Matrices
, 2019 A pair $(A,B)$ of square $(0,1)$-matrices is called a \emph{Lehman pair} if $AB^T=J+kI$ for some integer $k\in\{-1,1,2,3,\ldots\}$. In this case $A$ and $B$ are called \emph{Lehman matrices}.
Mayhew, Dillon +2 more
core +2 more sources
Hamiltonicity of cubic Cayley graphs
Journal of the European Mathematical Society, 2007 Following a problem posed by Lovász in 1969, it is believed that every finite connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from finite groups having a (2,s,3) -presentation ...
Glover, Henry, Marusic, Dragan
openaire +3 more sources