Results 11 to 20 of about 8,696,392 (355)
Solar cycle 25: another moderate cycle? [PDF]
The Astrophysical Journal Letters, 2016 Surface flux transport simulations for the descending phase of cycle 24 using random sources (emerging bipolar magnetic regions) with empirically determined scatter of their properties provide a prediction of the axial dipole moment during the upcoming ...
Cameron, Robert H. +2 more
core +3 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
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 ...
Knierim, Charlotte +3 more
openaire +2 more sources
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
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
International Economic Review, 2010 Operating overheads are widespread and lead to concentrated bursts of activity. To transfer resources between active and idle spells, agents demand financial assets. Futures contracts and lotteries are unsuitable, as they have substantial overheads of their own.
Clausen, Andrew, Strub, Carlo
openaire +8 more sources
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
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Completely independent spanning trees in some Cartesian product graphs
AIMS Mathematics, 2023 Let $ T_{1}, T_{2}, \dots, T_{k} $ be spanning trees of a graph $ G $. For any two vertices $ u, v $ of $ G $, if the paths from $ u $ to $ v $ in these $ k $ trees are pairwise openly disjoint, then we say that $ T_{1}, T_{2}, \dots, T_{k} $ are ...
Xia Hong , Wei Feng
doaj +1 more source