Results 121 to 130 of about 740,582 (289)

SIS Process with Heterogeneous Infection Rates in Wheel Graphs

Mathematics
The studies in epidemic-like processes have drawn much attention for the last decades. Structural or dynamical heterogeneity has been reported to have great impact on the statistical properties of the epidemic dynamics.
Libo Jiao, Dongchao Guo, Yueyue Wang
doaj   +1 more source

Bridging Flavour and Fragrance: A Behaviour‐Based Olfactory Pyramid for Whisky Maturation Inspired by Perfumery Principles

Flavour and Fragrance Journal, EarlyView.
This framework transposes the perfumery olfactory pyramid to whisky maturation by sequencing aromas into top, heart, and base notes according to their temporal persistence. Using Log P as a behaviour‐based classification axis and oak macromolecules as natural fixative analogues, it proposes a behaviour‐based aromatic wheel bridging flavour chemistry ...
Magali Picard
wiley   +1 more source

Quadratic Embedding Constants of Wheel Graphs

Interdisciplinary Information Sciences, 2017
Summary: A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently if the distance matrix is conditionally negative definite, or equivalently if the quadratic embedding constant (QEC) of a graph is non-positive. The QEC of wheel graphs are calculated explicitly.
openaire   +2 more sources

Railway wheel-flat and rail surface defect modelling and analysis by time–frequency techniques [PDF]

, 2013
Damage to the surface of railway wheels and rails commonly occurs in most railways. If not detected, it can result in rapid deterioration and possible failure of rolling stock and infrastructure components causing higher maintenance costs.
Liang, B., Liang, Bo, Crosbee, David, Zhao, Yunshi, Iwnicki, S. D., Zhao, Y., Iwnicki, Simon, Crosbee, D.   +7 more
core   +1 more source

Bank Income Smoothing, Societal Patriarchy and Policy Uncertainty

International Journal of Finance &Economics, EarlyView.
ABSTRACT Using a sample of 745 banks from 26 OECD countries over the period 1997–2023, we investigate the moderating effects of societal patriarchy on bank income smoothing (IS), amidst policy uncertainty (PU). Results indicate that in periods of high PU, banks operating in highly patriarchal societies tend to curtail the use of loan loss provisions ...
Tanveer Ahsan, Saqib Aziz, Akanksha Jalan, Fazal Muhammad, Dhoha Trabelsi   +4 more
wiley   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

Tree Independence Number III. Thetas, Prisms and Stars

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon   +2 more
wiley   +1 more source

On self-graphoidal graphs and their complements

Kuwait Journal of Science
The graphoidal graph G of graph H is the graph obtained by taking graphoidal cover Ψ of H as vertices and two vertices are adjacent if and only if the corresponding paths have a non-empty intersection.
Singh K.R., Pirzada S.
doaj   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source