Results 31 to 40 of about 676 (119)
A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs
, 2017 Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$ other than a directed cycle. Let $x,y$ be distinct vertices in $D$.
Darbinyan, Samvel Kh. +1 more
core +1 more source
Tight Hamilton Cycles in Random Uniform Hypergraphs [PDF]
, 2010 In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold.
Dudek, Andrzej, Frieze, Alan
core +11 more sources
Journal of Combinatorial Theory, Series B, 1999 It was shown by \textit{J. A. Bondy} [Stud. Sci. Math. Hung. 4, 473-475 (1969; Zbl 0184.27702)] that if \(G\) is a graph of order \(n\) in which \(d_G(x) + d_G(y) \geq n\) for each pair of nonadjacent vertices \(x\) and \(y\) of \(G\), then \(G\) is either pancyclic or the complete bipartite graph \(K_{n/2,n/2}\).
openaire +2 more sources
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Proceedings of the London Mathematical Society, Volume 109, Issue 3, Page 733-762, September 2014., 2014 A conjecture of Thomassen from 1982 states that, for every k, there is an f(k) so that every strongly f(k)‐connected tournament contains k edge‐disjoint Hamilton cycles. A classical theorem of Camion, that every strongly connected tournament contains a Hamilton cycle, implies that f(1)=1. So far, even the existence of f(2) was open.
Daniela Kühn +3 more
wiley +1 more source
Eulerian and pancyclic zero-divisor graphs of ordered sets
AKCE International Journal of Graphs and CombinatoricsIn this paper, we determine when the zero-divisor graph of a special class of a finite pseudocomplemented poset is Eulerian. Also, we deal with Hamiltonian, vertex pancyclic, and edge pancyclic properties of the complement of a zero-divisor graph of ...
Nilesh Khandekar, Vinayak Joshi
doaj +1 more source
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
Cycles in the burnt pancake graphs
, 2019 The pancake graph $P_n$ is the Cayley graph of the symmetric group $S_n$ on $n$ elements generated by prefix reversals. $P_n$ has been shown to have properties that makes it a useful network scheme for parallel processors.
Blanco, Saúl A. +2 more
core +1 more source
Pancyclicity of hamiltonian line graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
van Blanken, E. +2 more
openaire +1 more source
An Efficient Hierarchy Algorithm for Community Detection in Complex Networks
Mathematical Problems in Engineering, Volume 2014, Issue 1, 2014., 2014 Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time‐varying of the networks.
Lili Zhang +5 more
wiley +1 more source
Some local--global phenomena in locally finite graphs
, 2020 In this paper we present some results for a connected infinite graph $G$ with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonian and connectivity properties of $G$. (For a vertex $w$ of a graph $G$ the
Asratian, Armen S. +2 more
core +1 more source