Results 11 to 20 of about 4,029,048 (318)
On the problem of cyclization of “Little Tragedies” by A. S. Pushkin [PDF]
Известия Саратовского университета. Новая серия: Серия Филология, Журналистика, 2022 The article proposes a new version of the cycle-forming organization of “Little Tragedies” by A. S. Pushkin, after a brief excursion through the already existing cycle-forming concepts of a group of scenes and plays united in Russian culture under the ...
Zakharov, Kirill Mikhailovich
doaj +1 more source
Long cycles, heavy cycles and cycle decompositions in digraphs [PDF]
Journal of Combinatorial Theory, Series B, 2021 Hajós conjectured in 1968 that every Eulerian \(n\)-vertex graph can be decomposed into at most $\lfloor (n-1)/2\rfloor$ edge-disjoint cycles. This has been confirmed for some special graph classes, but the general case remains open. In a sequence of papers by Bienia and Meyniel (1986), Dean (1986), and Bollobás and Scott (1996) it was analogously ...
Charlotte Knierim +3 more
openaire +2 more sources
On The Investigating Cycle Properties In The Galilean Plane G^2
Eurasian Journal of Science and Engineering, 2023 The introduction of the Galilean plane within the affine plane parallels the familiar concepts of the Euclidean plane, extending the realm of geometric exploration.
Abdullah Kurudirek
doaj +1 more source
THE STUDY OF ECCENTRICITY SPECTRUM AND ENERGY IN PATH AND CYCLE GRAPHS
Barekeng, 2023 The eccentricity matrix is one of matrices to represent graphs. The eccentricity matrix is used as a basis for calculating the eccentricity spectrum and energy. This article aims to study the concepts of eccentricity spectrum and energy in simple graphs.
Ni Kadek Emik Sapitri +1 more
doaj +1 more source
Cycles intersecting edge-cuts of prescribed sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove that every cubic bridgeless graph $G$ contains a $2$-factor which intersects all (minimal) edge-cuts of size $3$ or $4$. This generalizes an earlier result of the authors, namely that such a $2$-factor exists provided that $G$ is planar.
Tomáš Kaiser, Riste Škrekovski
doaj +1 more source
LIFE CYCLE OF PRODUCTS AND CYCLES [PDF]
Macroeconomic Dynamics, 2010 The aim of this paper is to examine whether the development of waste recycling activities can be a source of economic fluctuations. We assume that the recycling sector has four fundamental characteristics. (i) The production factors are restricted by the production of the last period.
de Beir, Jean +2 more
openaire +5 more sources
African and Mediterranean Agricultural Journal - Al Awamia, 2023 Several zones in southwestern Morocco were surveyed following a recent exceptional invasion of a species of cicada in May 2021, which caused significant damage, particularly in young almond plantations. The objective is to identify the cicada causing the
Yamna Ouguas +5 more
doaj +1 more source
Monetary Cycles, Financial Cycles and the Business Cycle [PDF]
SSRN Electronic Journal, 2010 One of the most robust stylized facts in macroeconomics is the forecasting power of the term spread for future real activity. The economic rationale for this forecasting power usually appeals to expectations of future interest rates, which affect the slope of the term structure.
Tobias Adrian +2 more
openaire +3 more sources
Clustering Cycles into Cycles of Clusters [PDF]
Journal of Graph Algorithms and Applications, 2005 Summary: We study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case, testing the c-planarity can be done efficiently and give an efficient drawing
Pier Francesco Cortese +3 more
openaire +3 more sources
The Modular Irregularity Strength of C_n⊙mK_1
InPrime, 2022 Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α ...
Putu Kartika Dewi
doaj +1 more source