Results 61 to 70 of about 878 (132)

Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

, 2014
In 1992, Manoussakis conjectured that a strongly 2-connected digraph $D$ on $n$ vertices is hamiltonian if for every two distinct pairs of independent vertices $x,y$ and $w,z$ we have $d(x)+d(y)+d(w)+d(z)\geq 4n-3$.
Ning, Bo
core   +1 more source

Cycles and matchings in randomly perturbed digraphs and hypergraphs

, 2016
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation.
Krivelevich, Michael, Kwan, Matthew, Sudakov, Benny   +2 more
core   +1 more source

A Survey of Best Monotone Degree Conditions for Graph Properties [PDF]

, 2014
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.Comment: 25 ...
Bauer, D., Broersma, H. J., Heuvel, J. van den, Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R., Yatauro, M.   +7 more
core  

(2)-pancyclic graphs

Discrete Applied Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Cycle Spectrum of Claw-free Hamiltonian Graphs [PDF]

, 2013
If $G$ is a claw-free hamiltonian graph of order $n$ and maximum degree $\Delta$ with $\Delta\geq 24$, then $G$ has cycles of at least $\min\left\{ n,\left\lceil\frac{3}{2}\Delta\right\rceil\right\}-2$ many different lengths.Comment: 9 ...
Eckert, Jonas, Joos, Felix, Rautenbach, Dieter   +2 more
core  

Pancyclic subgraphs of random graphs [PDF]

Journal of Graph Theory, 2011
AbstractAn n‐vertex graph is called pancyclic if it contains a cycle of length t for all 3≤t≤n. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if p>n−1/2, then the random graph G(n, p) a.a.s.
Lee, Choongbum, Samotij, Wojciech
openaire   +2 more sources

Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes [PDF]

, 2010
The $n$-dimensional hypercube network $Q_n$ is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional locally twisted cube, denoted by $LTQ_n$, an important variation of the hypercube,
Hung, Ruo-Wei
core  

Extremal Results on ℓ-Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices

Mathematics
A graph of order n is called pancyclic if it contains a cycle of length y for every 3≤y≤n. The connectivity of an incomplete graph G, denoted by κ(G), is min{|W||WisavertexcutofG}. A graph G is said to be ℓ-connected if the connectivity κ(G)≥ℓ.
Jing Zeng, Hechao Liu, Lihua You
doaj   +1 more source

Two-Disjoint-Cycle-Cover Pancyclicity of Dragonfly Networks

Mathematics
Interconnection networks (often modeled as graphs) are critical for high-performance computing systems, as they have significant impact on performance metrics like latency and bandwidth.
Zengxian Tian, Guanlin He
doaj   +1 more source

Sifat - Sifat Graf Yang Memuat Semua SIklus [PDF]

Graf merupakan pasangan himpunan berhingga yang anggotanya disebut himpunan titik dan himpunan yang anggotanya adalah pasangan titik yang disebut sisi. Banyaknya sisi yang terkait pada satu titik merupakan derajat titik tersebut. Suatu graf yang memiliki
Oktaviani, Nur Rohmah
core   +3 more sources