Results 21 to 30 of about 33,701 (288)
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
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
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
Discrete Mathematics, 1993 If the complete graph on \(n\) vertices is edge-colored such that the number of times that a color may occur is less than \(cn/\log(n)\), where \(c\) is a fixed constant, then there is a Hamiltonian cycle in which no two edges have the same color.
Frieze, Alan, Reed, Bruce
openaire +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
Rainbow Hamilton Cycles in Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 Let $K_n^{(k)}$ be the complete $k$-uniform hypergraph, $k\ge3$, and let $\ell$ be an integer such that $1\le \ell\le k-1$ and $k-\ell$ divides $n$. An $\ell$-overlapping Hamilton cycle in $K_n^{(k)}$ is a spanning subhypergraph $C$ of $K_n^{(k)}$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists
Dudek, Andrzej +2 more
openaire +2 more sources
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
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
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