اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Hamilton Decompositions
110
0
0.0
(
0
)
تأليف
Dhananjay P. Mehendale
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tournament on (2n+1) points and show that it can be decomposed in directed Hamilton circuits when (2n+1) is a prime number. When (2n+1) is not a prime number this method does not work and we will need to devise some another method. We also propose a general method to find Hamilton decomposition of certain tournament for all sizes.
قيم البحث
اقرأ أيضاً
It is proved that if a graph is regular of even degree and contains a Hamilton cycle, or regular of odd degree and contains a Hamiltonian $3$-factor, then its line graph is Hamilton decomposable. This result partially extends Kotzigs result that a $3
$-regular graph is Hamiltonian if and only if its line graph is Hamilton decomposable, and proves the conjecture of Bermond that the line graph of a Hamilton decomposable graph is Hamilton decomposable.
This paper discusses the problem of symmetric tensor decomposition on a given variety $X$: decomposing a symmetric tensor into the sum of tensor powers of vectors contained in $X$. In this paper, we first study geometric and algebraic properties of s
uch decomposable tensors, which are crucial to the practical computations of such decompositions. For a given tensor, we also develop a criterion for the existence of a symmetric decomposition on $X$. Secondly and most importantly, we propose a method for computing symmetric tensor decompositions on an arbitrary $X$. As a specific application, Vandermonde decompositions for nonsymmetric tensors can be computed by the proposed algorithm.
We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then define correct
contraction procedure to be executed to get largest possible complete graph from given connected graph. We finally give a characterization for k-chromatic graphs and use it to settle Hadwigers conjecture.
In this paper we discuss various philosophical aspects of the hyperstructure concept extending networks and higher categories. By this discussion we hope to pave the way for applications and further developments of the mathematical theory of hyperstructures.
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal to r. This is well-known Caccetta-Haggkvist problem.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
