Results 11 to 20 of about 1,021,103 (192)
Hamilton cycles and algorithms [PDF]
, 2022 We present three results in graph theory, united by the themes of Hamilton cycles and algorithms. A Hamilton cycle in a graph is a cycle that contains every vertex of the graph.
Stroh, F.J.M.
core +8 more sources
, 1969 Experimental film with Hamilton’s VO: "I don’t like art films…" Newsreel of Hollywood parade. Experimental film; shot of Marilyn Monroe at Grauman’s Chinese Theater, 1957 Cadillac advertisement, Hommage à Chrysler Corp, a painting by Hamilton inspired ...
core +4 more sources
Hamilton Cycles in Double Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2019 Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduced the double generalized Petersen graphs (DGPGs). Kutnar and Petecki proved that DGPGs are Hamiltonian in special cases and conjectured that all DGPGs are
Sakamoto Yutaro
doaj +1 more source
Saffron for the management of premenstrual dysphoric disorder: A randomized controlled trial
Advanced Biomedical Research, 2020 Background: Selective serotonin reuptake inhibitors are among the most common agents have been used for the treatment of the premenstrual dysphoric disorder (PMDD); however, due to the diversity in the outcomes and adverse effects, efforts are in ...
Fatemeh Rajabi +3 more
doaj +1 more source
The influence of malocclusion, sucking habits and dental caries in the masticatory function of preschool children [PDF]
Brazilian Oral Research, 2020 The aim of this study was to evaluate the association of malocclusion, nutritive and non-nutritive sucking habits and dental caries in the masticatory function of preschool children.
Débora SOUTO-SOUZA +5 more
doaj +1 more source
Algorithms, 2018 A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c ≤ k
Ruth Haas, Gary MacGillivray
doaj +1 more source
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source
Two Sufficient Conditions for Hamilton and Dominating Cycles
International Journal of Mathematics and Mathematical Sciences, 2012 We prove that if is a 2-connect graph of size (the number of edges) and minimum degree with , where when and when , then each longest cycle in is a dominating cycle.
Zh. G. Nikoghosyan
doaj +1 more source
Graph Invariants and Large Cycles: A Survey
International Journal of Mathematics and Mathematical Sciences, 2011 Graph invariants provide a powerful analytical tool for investigation of abstract substructures of graphs. This paper is devoted to large cycle substructures, namely, Hamilton, longest and dominating cycles and some generalized cycles including Hamilton ...
Zh. G. Nikoghosyan
doaj +1 more source
Testing of pandemic ventilators under early and agile development
Frontiers in Medical Technology, 2022 Aiming to address clinical requirements subsequent to SARS-CoV-2-related pulmonary disease, multiple research groups and industry groups carried out intensive studies to develop pandemic ventilators (PDVs).
Nikolaos Tachatos +7 more
doaj +1 more source