Results 31 to 40 of about 787 (166)

On Generalizations of Pairwise Compatibility Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri   +3 more
doaj   +1 more source

Generalization of Ramsey Number for Cycle with Pendant Edges

open access: yesMathematics
This paper explores various Ramsey numbers associated with cycles with pendant edges, including the classical Ramsey number, the star-critical Ramsey number, the Gallai–Ramsey number, and the star-critical Gallai–Ramsey number.
Jagjeet Jakhar   +5 more
doaj   +1 more source

Metagenomic Association Uncovers Host Genotype‐Structured Rhizobacterial Networks and Novel Taxa That Enhance Soybean Salt Tolerance

open access: yesAdvanced Science, EarlyView.
An STI‐guided metagenomic association framework links soybean salt‐tolerance phenotypes with rhizosphere microbiome composition and network organization in natural saline soils. The approach identifies candidate beneficial taxa, including Thalassospira xiamenensis, and provides an efficient strategy for mining stress‐protective microbes from native ...
Yu Luo   +3 more
wiley   +1 more source

Detection of Emergent Situations in Complex Systems by Structural Invariant (MB, M)

open access: yesMendel, 2017
The paper introduces complete description of the detection method that uses structural invariant Matroid and its Bases (MB, M). There are recapitulated essential concepts from the used knowledge field as “complex system, emergent situations (A, B, C ...
Jiri Bila, Martin Novak
doaj   +1 more source

Price Transmission and Leadership in the Global Poultry Market: Results From Parametric and Nonparametric Approaches

open access: yesAgribusiness, EarlyView.
ABSTRACT Brazil and the United States account for more than 40% of global poultry exports, with China and South Korea among their major destination markets. This study examines price transmission and market linkages between Brazil and the United States using monthly poultry export price data from January 1990 to December 2024. It also assesses which of
Khondoker Abdul Mottaleb   +2 more
wiley   +1 more source

On the use of senders in generalized ramsey theory for graphs

open access: yesDiscrete Mathematics, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan A. Burr   +2 more
openaire   +1 more source

Household Consumption Intentions by Income Group During Monetary Policy Easing and Tightening

open access: yesInternational Journal of Finance &Economics, EarlyView.
ABSTRACT We investigate how the monetary policy interest rate affects Brazilian households' consumption intentions under two distinct regimes: monetary easing and tightening cycles. Using data from low‐ and high‐income households, we assess both the magnitude and the dynamics of this relationship.
Helder Ferreira de Mendonça   +1 more
wiley   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

open access: yesJournal 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

Temporal Ramsey Graphs: The Ramsey Kinematic Approach to the Motion of Systems of Material Points

open access: yesDynamics
The Ramsey approach is applied to analyses of the kinematics of systems built of non-relativistic, motile point masses/particles. This approach is based on colored graph theory. Point masses/particles serve as the vertices of the graph.
Edward Bormashenko
doaj   +1 more source

Tree Independence Number III. Thetas, Prisms and Stars

open access: yesJournal 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   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy