A New Property of Hamilton Graphs
نویسنده
چکیده
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this paper, we give out some new kind of definitions of the subgraphs and determine the Hamiltoncity of edges according to the existence of the subgraphs in a graph, and then obtain a new property of Hamilton graphs as being a necessary and sufficient condition characterized in the connectivity of the subgraph that induced from the cycle structure of a given graph. MSC2010 05C45
منابع مشابه
Finding Hamilton cycles in robustly expanding digraphs
We provide an NC algorithm for finding Hamilton cycles in directed graphs with a certain robust expansion property. This property captures several known criteria for the existence of Hamilton cycles in terms of the degree sequence and thus we provide algorithmic proofs of (i) an ‘oriented’ analogue of Dirac’s theorem and (ii) an approximate version (for directed graphs) of Chvátal’s theorem.
متن کاملFinding Hamilton cycles in random graphs with few queries
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of G(n, p) in order to typically find a subgraph possessing a given target property. We show that if p ≥ lnn+ln lnn+ω(1) n , then one can find a Hamilton cycle with high probability after exposing (1+o(1))n edges. Our result i...
متن کاملOn the Number of Hamilton Cycles in Bounded Degree Graphs
The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs – deriving thereby extremal bounds. We describe an algorithm which enumerates all Hamilton cycles of a given 3-regular n-vertex graph in time O(1.276), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276) for the maximum number of Hamilton cycles in 3-regul...
متن کاملOn the number of specific spanning subgraphs of the graphs G x Pn
This paper investigates the number of spanning subgraphs of the product of an arbitrary graph G with the path graphs Pn on n vertices that meet certain properties: connectivity, acyclicity, Hamiltonicity, and restrictions on degree. A general method is presented for constructing a recurrence equation R(n) for the graphs G Pn, giving the number of spanning subgraphs that satisfy a given combinat...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1508.00068 شماره
صفحات -
تاریخ انتشار 2015