Results 71 to 80 of about 9,811 (181)
Trade and ethnolinguistic differences: A replication and extension
Economic Inquiry, Volume 64, Issue 1, Page 38-53, January 2026.Abstract We revisit the role of trade on long‐run inter‐ethnic linguistic differences. Dickens (2022) hypothesized that neighboring languages are more similar when agriculture provides potential gains from inter‐ethnic trade. Since his empirical approach confounds inter‐ and intra‐ethnic trade, we replicate his main analysis using improved measures of ...
Javier Gonzalez, Ömer Özak
wiley +1 more source
The general position problem and strong resolving graphs
Open Mathematics, 2019 The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj +1 more source
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract Sunflowers, or Δ$\Delta$‐systems, are a fundamental concept in combinatorics introduced by Erdős and Rado in their paper: [J. London Math. Soc. (1) 35 (1960), 85–90]. A sunflower is a collection of sets where all pairs have the same intersection.
Anup Rao
wiley +1 more source
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2016 Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota +2 more
doaj +1 more source
International Journal of Energy Research, Volume 2026, Issue 1, 2026.An integrated energy system (IES) can alleviate energy crises, promote multi‐energy complementarity, and enhance finer‐grained energy development. Nuclear power is clean and efficient, mainly when using small modular reactors (SMRs), which increase power generation, improve system flexibility, and promote a low‐carbon economy.
Pham Van Phu +6 more
wiley +1 more source
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this article, the first eccentricity connectivity coindex is introduced as ECI¯G=∑uv∉EGε2u+ε2v, in which ε(u) denotes the eccentricity of the vertex u in the simple connected graph G. Then, the exact expressions are obtained for the first eccentricity connectivity coindex of some graph products.
Suha Wazzan +2 more
wiley +1 more source
Quantum automorphism groups of lexicographic products of graphs [PDF]
Journal of the London Mathematical SocietyAbstractSabidussi's theorem [Duke Math. J. 28 (1961), 573–578] gives necessary and sufficient conditions under which the automorphism group of a lexicographic product of two graphs is a wreath product of the respective automorphism groups. We prove a quantum version of Sabidussi's theorem for finite graphs, with the automorphism groups replaced by ...
Arnbjörg Soffía Árnadóttir +4 more
openaire +2 more sources
Choice or competition: Does integration benefit everyone?
Theoretical Economics, Volume 21, Issue 1, Page 1-21, January 2026.Matching markets are often fragmented, organized at a small local level. While integration of matching markets may lead to welfare gains by expanding choice, it may also harm some market participants by increasing competition for the same resources. We show that every “good” mechanism fails the monotonicity requirement that no individuals be hurt by ...
Yuichiro Kamada, Fuhito Kojima
wiley +1 more source
Bondage Number of Lexicographic Product of Two Graphs
International Journal of Innovative Technology and Exploring Engineering, 2019 The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with a domination number greater than the domination number of G. In this paper, we study the bondage number of the Lexicographic product of two paths, Lexicographic product of path and a graph with given maximum degree.
Dr. Deepak. G +2 more
openaire +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon +2 more
wiley +1 more source