Results 1 to 10 of about 121 (50)

Finding Hamilton cycles in random intersection graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj   +1 more source

Identifying Hamilton cycles in the Cartesian product of directed cycles

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj   +1 more source

Matchings and Hamilton cycles in hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj   +1 more source

On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj   +1 more source

Well-spread sequences and edge-labellings with constant Hamilton-weight [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
A sequence (a_i) of integers is \emphwell-spread if the sums a_i+a_j, for ...
Peter Mark Kayll
doaj   +1 more source

Difference divisor graph of the finite group [PDF]

open access: yesInternational Journal of Research in Industrial Engineering, 2018
Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that ...
R. V M S S Kiran Kumar, T. Chalapathi
doaj   +1 more source

A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs

open access: yesJournal of Mathematical and Fundamental Sciences, 2013
A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman   +2 more
doaj   +1 more source

Trends, Cycles and Seasonal Variations of Ukrainian Gross Domestic Product [PDF]

open access: yesFinancial Markets, Institutions and Risks, 2020
The article attempts to study trends, seasonal variations and cyclical fluctuations of Ukraine’s quarterly GDP at current prices. The period of the study is from the first quarter of 2010 to the first quarter of 2020.
Debesh Bhowmik
doaj   +1 more source

Symmetric Hamilton Cycle Decompositions of Complete Multigraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2.
Chitra V., Muthusamy A.
doaj   +1 more source

Families of triples with high minimum degree are hamiltonian

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj   +1 more source

Home - About - Disclaimer - Privacy