Results 111 to 120 of about 1,017,247 (314)
Business Strategy and the Environment, EarlyView.ABSTRACT This study systematizes the literature on eco‐innovation and economic complexity, aiming to understand how the sophistication of productive structures shapes countries' capacity to develop environmentally responsible innovations, and how eco‐innovation may, in turn, influence productive sophistication.
Gregory Matheus Pereira de Moraes +1 more
wiley +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
On bipartite (1,1,k)-mixed graphs [PDF]
The degree/diameter problem consists of finding the graph (or graphs) with the largest possible number of vertices, given a maximum degree and a diameter. This famous problem was extended to digraphs and mixed graphs. Mixed graphs can be seen as digraphs
Dalfó, Cristina +7 more
core +1 more source
Conditional Randomization Tests for the Specification of Interference Structure
Journal of Applied Econometrics, EarlyView.ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source
Simple graph models of information spread in finite populations [PDF]
Royal Society Open Science, 2015 We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs.
Burton Voorhees, Bergerud Ryder
doaj +1 more source
Discrete Applied Mathematics, 1987 It is shown that bipartite permutation graphs have good algorithmic properties in contrast to general bipartite or permutation graphs. Two characterizations of these graphs are presented which lead to a linear time recognition algorithm and also to polynomial algorithms for Hamiltonian problems, a variant of the crossing number problem and the minimum ...
Jeremy P. Spinrad +2 more
openaire +1 more source
Regular bipartite graphs and intersecting families [PDF]
Journal of Combinatorial Theory, 2016 In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the size of ...
A. Kupavskii, D. Zakharov
semanticscholar +1 more source
Det-Extremal Cubic Bipartite Graphs [PDF]
, 2003 Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matrix A. We say G is det-extremal if per(A) = |det(A)|. Det-extremal k-regular bipartite graphs exist only for k = 2 or 3.
D. Labbate +6 more
core +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr +3 more
wiley +1 more source