Results 161 to 170 of about 3,577 (286)
Domination number of Cartesian product of graphs
, 2013 For a graph G, (G) is the domination number of G. Vizing [2] conjectured that gamma(G Box H) >= gamma(G)gamma(H) for any graph G and H, where G Box H is the Cartesian product of graphs G and H.
Wang, Wen
core
The Legacy of Policy Inaction in Climate‐Growth Models
International Economic Review, EarlyView.ABSTRACT To better understand the structure and core mechanisms of a broad class of climate‐growth models, we study a simplified version of the dynamic integrated model of climate and the economy (DICE) through the lens of growth theory. We analytically show that this model features a continuum of saddle‐point stable steady states.
Thomas Steger, Timo Trimborn
wiley +1 more source
Interest Rate Pegs and the Reversal Puzzle: On the Role of Anticipation
Journal of Money, Credit and Banking, EarlyView.Abstract We revisit the reversal puzzle: a counterintuitive contraction of inflation in response to an interest rate peg. We show that its occurrence is intimately related to the degree of agents' anticipation. If agents perfectly anticipate the peg, reversals occur depending on the duration of the peg.
RAFAEL GERKE +2 more
wiley +1 more source
Behzad-Vizing conjecture and Cartesian-product graphs
, 2015 We prove the following theorem: if the Behzad-Vizing conjecture is true for graphs ▫$G$▫ and ▫$H$▫, then is it true for the cartesian product ▫$G Box H$▫.Dokazali smo naslednji izrek: Če Behzad-Vizingova domneva velja za grafa ▫$G$▫ in ▫$H$▫, potem velja
Zmazek, Blaž, Žerovnik, Janez
core
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
A lightweight cryptographic algorithm incorporating path coloring of cartesian product of graphs. [PDF]
Sci RepShivapriya P, Meera KN, Lin Y.
europepmc +1 more source
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan +5 more
wiley +1 more source
The Cartesian Gaussian additive noise model for directed network inference in omics data. [PDF]
BMC Med Res MethodolAndrew B, Westhead DR, Cutillo L.
europepmc +1 more source
, 2018 In graph theory, different types of product of two graphs have been studied, e.g. Cartesian product, Tensor product, Strong product, etc. Later on, Cartesian product and Tensor product have been generalized by 2-Cartesian product and 2-Tensor product. In
Mehta, H. S., Acharya, U. P.
core
Review of Education, Volume 14, Issue 2, August 2026.Abstract This systematic review analyses 32 studies published between 2013 and 2024 on the Mathematics Teacher's Specialised Knowledge (MTSK) model, with the aim of understanding its theoretical development, practical applications and contributions to teacher education in secondary and pre‐university contexts.
Daniel Martín‐Cudero
wiley +1 more source