نتایج جستجو برای: cycle graph
تعداد نتایج: 463294 فیلتر نتایج به سال:
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21 ≈ 1.619m and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27 ≈ 1.630m.
Given a set of cycles C of a graph G, the tree graph of G, defined by C, is the graph T (G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if R∪S contains exactly one cycle and this cycle lies in C. Li et al. [Discrete Math. 271 (2003), 303–310] proved that if the graph T (G,C) is connected, then C cyclically spans the cycle space of G. Later, Yumei Hu ...
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A {−1,0,1} edge incidence vector is associated with each cycle: edges traversed by the cycle in the right dire...
Graphs can be used to model various problems and relations in diverse domains eg. Computer Science, Biological, Chemical and many other. There exist various hard problems in communication networks, which are practically hard but can be shaped in the form of graphs. A Hamiltonian Path is a spanning trail in a network graph i.e. a path through every network node and a spanning cycle in a network ...
A bent Hamilton cycle in a grid graph is one in which each edge in a successive pair of edges lies in a different dimension. We show that the d-dimensional grid graph has a bent Hamilton cycle if some dimension is even and d ≥ 3, and does not have a bent Hamilton cycle if all dimensions are odd. In the latter case, we determine the conditions for when a bent Hamilton path exists. For the d-dime...
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید