Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "pancyclic" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Pancyclism and small cycles in graphs
    Autorzy:
    Faudree, Ralph
    Favaron, Odile
    Flandrin, Evelynei
    Li, Hao
    Powiązania:
    https://bibliotekanauki.pl/articles/972039.pdf
    Data publikacji:
    1996
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    cycle
    hamiltonian
    pancyclic
    Opis:
    We first show that if a graph G of order n contains a hamiltonian path connecting two nonadjacent vertices u and v such that d(u)+d(v) ≥ n, then G is pancyclic. By using this result, we prove that if G is hamiltonian with order n ≥ 20 and if G has two nonadjacent vertices u and v such that d(u)+d(v) ≥ n+z, where z = 0 when n is odd and z = 1 otherwise, then G contains a cycle of length m for each 3 ≤ m ≤ max (d_C(u,v)+1, [(n+19)/13]), $d_C(u,v)$ being the distance of u and v on a hamiltonian cycle of G.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1996, 16, 1; 27-40
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On k-Path Pancyclic Graphs
    Autorzy:
    Bi, Zhenming
    Zhang, Ping
    Powiązania:
    https://bibliotekanauki.pl/articles/31339488.pdf
    Data publikacji:
    2015-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Hamiltonian
    panconnected
    pancyclic
    path Hamiltonian
    path pancyclic
    Opis:
    For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
    Źródło:
    Discussiones Mathematicae Graph Theory; 2015, 35, 2; 271-281
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the stability for pancyclicity
    Autorzy:
    Schiermeyer, Ingo
    Powiązania:
    https://bibliotekanauki.pl/articles/743483.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    pancyclic graphs
    stability
    Opis:
    A property P defined on all graphs of order n is said to be k-stable if for any graph of order n that does not satisfy P, the fact that uv is not an edge of G and that G + uv satisfies P implies $d_G(u) + d_G(v) < k$. Every property is (2n-3)-stable and every k-stable property is (k+1)-stable. We denote by s(P) the smallest integer k such that P is k-stable and call it the stability of P. This number usually depends on n and is at most 2n-3. A graph of order n is said to be pancyclic if it contains cycles of all lengths from 3 to n. We show that the stability s(P) for the graph property "G is pancyclic" satisfies max(⎡6n/5]⎤-5, n+t) ≤ s(P) ≤ max(⎡4n/3]⎤-2,n+t), where t = 2⎡(n+1)/2]⎤-(n+1).
    Źródło:
    Discussiones Mathematicae Graph Theory; 2001, 21, 2; 223-228
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Strongly pancyclic and dual-pancyclic graphs
    Autorzy:
    McKee, Terry
    Powiązania:
    https://bibliotekanauki.pl/articles/743097.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    pancyclic graph
    cycle extendable
    chordal graph
    pancyclic matroid
    dual-chordal graph
    Opis:
    Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another cycle C⁺. This is equivalent to requiring, in addition, that the sizes of C¯ and C⁺ differ by one from the size of C. Strongly pancyclic graphs are pancyclic and chordal, and their cycles enjoy certain interpolation and extrapolation properties with respect to almost containment. Much of this carries over from graphic to cographic matroids; the resulting 'dual-pancyclic' graphs are shown to be exactly the 3-regular dual-chordal graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2009, 29, 1; 5-14
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A note on a new condition implying pancyclism
    Autorzy:
    Flandrin, Evelyne
    Li, Hao
    Marczyk, Antoni
    Woźniak, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/743445.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hamiltonian graphs
    pancyclic graphs
    cycles
    Opis:
    We first show that if a 2-connected graph G of order n is such that for each two vertices u and v such that δ = d(u) and d(v) < n/2 the edge uv belongs to E(G), then G is hamiltonian. Next, by using this result, we prove that a graph G satysfying the above condition is either pancyclic or isomorphic to $K_{n/2,n/2}$.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2001, 21, 1; 137-143
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    New sufficient conditions for hamiltonian and pancyclic graphs
    Autorzy:
    Schiermeyer, Ingo
    Woźniak, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/743639.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hamiltonian graphs
    pancyclic graphs
    closure
    Opis:
    For a graph G of order n we consider the unique partition of its vertex set V(G) = A ∪ B with A = {v ∈ V(G): d(v) ≥ n/2} and B = {v ∈ V(G):d(v) < n/2}. Imposing conditions on the vertices of the set B we obtain new sufficient conditions for hamiltonian and pancyclic graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 1; 29-38
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
    Autorzy:
    Affif Chaouche, Fatima
    Rutherford, Carrie G.
    Whitty, Robin W.
    Powiązania:
    https://bibliotekanauki.pl/articles/31339337.pdf
    Data publikacji:
    2015-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    extremal graph theory
    pancyclic graph
    Hamilton cycle
    Opis:
    It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required. A possibly ‘intermediate’ variation is the following: given k, 1 ≤ k ≤ n, how many chords must be added to ensure that there exist cycles of every possible length each of which passes exactly k chords? For fixed k, we establish a lower bound of Ω(n1/k) on the growth rate.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2015, 35, 3; 533-539
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Forbidden Pairs and (k, m)-Pancyclicity
    Autorzy:
    Crane, Charles Brian
    Powiązania:
    https://bibliotekanauki.pl/articles/31341696.pdf
    Data publikacji:
    2017-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hamiltonian
    pancyclic
    forbidden subgraph
    cycle
    claw-free
    Opis:
    A graph G on n vertices is said to be (k,m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . ., n}. This property, which generalizes the notion of a vertex pancyclic graph, was defined by Faudree, Gould, Jacobson, and Lesniak in 2004. The notion of (k, m)-pancyclicity provides one way to measure the prevalence of cycles in a graph. We consider pairs of subgraphs that, when forbidden, guarantee hamiltonicity for 2-connected graphs on n ≥ 10 vertices. There are exactly ten such pairs. For each integer k ≥ 1 and each of eight such subgraph pairs {R, S}, we determine the smallest value m such that any 2-connected {R, S}-free graph on n ≥ 10 vertices is guaranteed to be (k,m)-pancyclic. Examples are provided that show the given values are best possible. Each such example we provide represents an infinite family of graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2017, 37, 3; 649-663
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Note on the Ramsey Number of Even Wheels Versus Stars
    Autorzy:
    Haghi, Sh.
    Maimani, H.R.
    Powiązania:
    https://bibliotekanauki.pl/articles/31342334.pdf
    Data publikacji:
    2018-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Ramsey number
    star
    wheel
    weakly pancyclic
    Opis:
    For two graphs $ G_1 $ and $ G_2 $, the Ramsey number $ R(G_1,G_2) $ is the smallest integer $N$, such that for any graph on $N$ vertices, either $G$ contains $ G_1 $ or $ \overline{G} $ contains $ G_2 $. Let $ S_n $ be a star of order $n$ and $ W_m $ be a wheel of order $ m + 1 $. In this paper, we will show $ R(W_n, S_n) \le 5n//2 − 1 $, where $ n \ge 6 $ is even. Also, by using this theorem, we conclude that $ R(W_n, S_n) = 5n//2 − 2 $ or $ 5n//2 −1 $, for $ n \ge 6 $ and even. Finally, we prove that for sufficiently large even n we have $ R(W_n, S_n) = 5n//2 − 2 $.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 2; 397-404
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Chvátal-Erdos condition and pancyclism
    Autorzy:
    Flandrin, Evelyne
    Li, Hao
    Marczyk, Antoni
    Schiermeyer, Ingo
    Woźniak, Mariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/743987.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hamiltonian graphs
    pancyclic graphs
    cycles
    connectivity
    stability number
    Opis:
    The well-known Chvátal-Erdős theorem states that if the stability number α of a graph G is not greater than its connectivity then G is hamiltonian. In 1974 Erdős showed that if, additionally, the order of the graph is sufficiently large with respect to α, then G is pancyclic. His proof is based on the properties of cycle-complete graph Ramsey numbers. In this paper we show that a similar result can be easily proved by applying only classical Ramsey numbers.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2006, 26, 2; 335-342
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Alternating-Pancyclism in 2-Edge-Colored Graphs
    Autorzy:
    Cordero-Michel, Narda
    Galeana-Sánchez, Hortensia
    Powiązania:
    https://bibliotekanauki.pl/articles/32222696.pdf
    Data publikacji:
    2021-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    2-edge-colored graph
    alternating cycle
    alternating-pancyclic graph
    Opis:
    An alternating cycle in a 2-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let $ G_1, . . ., G_k $ be a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum of $ G_1, . . ., G_k $, denoted by $ \oplus_{i=1}^k G_i $, is the set of all 2-edge-colored graphs $G$ such that: (i) \( V(G)= \bigcup _{i=1}^k V(G_i) \), (ii) $ G \langle V(G_i) \rangle \cong G_i $ for $ i = 1, . . ., k $ where $ G \langle V(G_i) \rangle $ has the same coloring as $ G_i $ and (iii) between each pair of vertices in different summands of $G$ there is exactly one edge, with an arbitrary but fixed color. A graph $G$ in $\oplus_{i=1}^k G_i $ will be called a colored generalized sum (c.g.s.) and we will say that $ e \in E(G) $ is an exterior edge if and only if \( e \in E(G) \backslash ( \bigcup_{i=1}^k E(G_i)) \). The set of exterior edges will be denoted by $ E_\oplus $. A 2-edge-colored graph $G$ of order $2n$ is said to be an alternating-pancyclic graph, whenever for each $ l \in {2, . . ., n} $, there exists an alternating cycle of length $2l$ in $G$. The topics of pancyclism and vertex-pancyclism are deeply and widely studied by several authors. The existence of alternating cycles in 2-edge-colored graphs has been studied because of its many applications. In this paper, we give sufficient conditions for a graph $ G \in \oplus_{i=1}^k G_i $ to be an alternating-pancyclic graph.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 3; 779-800
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Hamiltonian and Pancyclic Graphs in the Class of Self-Centered Graphs with Radius Two
    Autorzy:
    Hrnčiar, Pavel
    Monoszová, Gabriela
    Powiązania:
    https://bibliotekanauki.pl/articles/31342283.pdf
    Data publikacji:
    2018-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    self-centered graph with radius 2
    Hamiltonian graph
    pancyclic graph
    size of graph
    Opis:
    The paper deals with Hamiltonian and pancyclic graphs in the class of all self-centered graphs of radius 2. For both of the two considered classes of graphs we have done the following. For a given number n of vertices, we have found an upper bound of the minimum size of such graphs. For n ≤ 12 we have found the exact values of the minimum size. On the other hand, the exact value of the maximum size has been found for every n. Moreover, we have shown that such a graph (of order n and) of size m exists for every m between the minimum and the maximum size. For n ≤ 10 we have found all nonisomorphic graphs of the minimum size, and for n = 11 only for Hamiltonian graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 3; 661-681
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies