Temat: Hamiltonian - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A conjecture on the prevalence of cubic bridge graphs
Autorzy:: Filar, Jerzy
Haythorpe, Michael
Nguyen, Giang
Powiązania:: https://bibliotekanauki.pl/articles/744564.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Hamiltonian graph
non-Hamiltonian graph
cubic bridge graph
Opis:: Almost all d-regular graphs are Hamiltonian, for d ≥ 3 [8]. In this note we conjecture that in a similar, yet somewhat different, sense almost all cubic non-Hamiltonian graphs are bridge graphs, and present supporting empirical results for this prevalence of the latter among all connected cubic non-Hamiltonian graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 1; 175-179
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The Ryjáček Closure and a Forbidden Subgraph
Autorzy:: Saito, Akira
Xiong, Liming
Powiązania:: https://bibliotekanauki.pl/articles/31340869.pdf
Data publikacji:: 2016-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: closure
claw-free graph
Hamiltonian graph
perfect matching
traceable graph
Opis:: The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to this hope, and show that the claw is the only forbidden subgraph that produces non-trivial results on Hamiltonicity by the use of the Ryjáček closure.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 3; 621-628
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: A Note on the Total Detection Numbers of Cycles
Autorzy:: Escuadro, Henry E.
Fujie, Futaba
Musick, Chad E.
Powiązania:: https://bibliotekanauki.pl/articles/31339492.pdf
Data publikacji:: 2015-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: vertex-distinguishing coloring
detectable labeling
detection number
total detection number
Hamiltonian graph
Opis:: Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . ., k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a₀, a₁, . . ., a_k−1), where ai is the number of edges incident with v that are labeled i for 0 ≤ i ≤ k − 1. The labeling c is called a detectable labeling if distinct vertices in G have distinct color codes. The value val(c) of a detectable labeling c of a graph G is the sum of the labels assigned to the edges in G. The total detection number td(G) of G is defined by td(G) = min{val(c)}, where the minimum is taken over all detectable labelings c of G. We investigate the problem of determining the total detection numbers of cycles.
Źródło:: Discussiones Mathematicae Graph Theory; 2015, 35, 2; 237-247
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

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ł

Informacja