Results 1 to 10 of about 8,030,126 (205)
Algorithm for identification of piecewise smooth hybrid systems; application to eukaryotic ...
Ovidiu Radulescu +2 more
core
On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +1 more source
The cycles of real estate market in the Baltic countries
Technological and Economic Development of Economy, 2006 The authors in the article analyse (in theoretical and practical aspects) factors influencing real estate market, underline their impact on economic development in the long and short run.
Birute Galiniene +2 more
doaj +1 more source
Measuring the Welfare Costs of Inflation in a Life-cycle Model [PDF]
In macroeconomics, life-cycle models are typically used to address exclusively life-cycle issues. This paper shows that modeling the life-cycle may be important when addressing public policy issues, in this case the welfare costs of inflation.
Paul Gomme
core
Shortest cycle covers and cycle double covers with large 2-regular subgraphs
, 2013 In this paper we show that many snarks have shortest cycle covers of length $\frac{4}{3}m+c$ for a constant $c$, where $m$ is the number of edges in the graph, in agreement with the conjecture that all snarks have shortest cycle covers of length $\frac{4}
Hägglund, Jonas, Markstrøm, Klas
core +1 more source
COMPOSITIONAL AND DRAMATURGICAL ELEMENTS IN GHEORGHE NEAGA’S SUITE FOR STRING QUARTET [PDF]
Studiul Artelor şi Culturologie: Istorie, Teorie, Practică, 2018 Opuses in the suite genre represent a significant part in Gheorghe Neaga’s instrumental chamber repertoire, but also keep an important place in the gold heritage of the autochthonous chamber music.
Chiciuc Natalia
doaj
Discussiones Mathematicae Graph Theory, 2014 Let G = G1 ∪ G2 be the sum of two simple graphs G1,G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1,G2 connected by two edges e1 and e2 which form a cycle C4 inside G.
Badura Lidia
doaj +1 more source
Revista Brasileira de Fruticultura, 2009 O objetivo do trabalho foi avaliar o crescimento e a produção de genótipos de 3 grupos genômicos de bananeira: 'Nanicão-IAC-2001', 'Grande Naine', 'Caipira' e 'Nam' (AAA); 'maçã', 'Thap maeo', 'Prata-Anã' e 'Prata-Zulu' (AAB); 'FHIA 01', 'FHIA 18 ...
Dayana Portes Ramos +3 more
doaj +1 more source
Stirling cycle cryogenic cooler [PDF]
, 1983 A long lifetime Stirling cycle cryogenic cooler particularly adapted for space applications is described. It consists of a compressor section centrally aligned end to end with an expansion section, and respectively includes a reciprocating compressor ...
Daniels, A. +4 more
core +1 more source
On the H-Force Number of Hamiltonian Graphs and Cycle Extendability
Discussiones Mathematicae Graph Theory, 2017 The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given.
Hexel Erhard
doaj +1 more source