Results 161 to 170 of about 635,864 (319)

Enumeration and Construction of Row‐Column Designs

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger   +3 more
wiley   +1 more source

Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh   +2 more
wiley   +1 more source

On Endomorphism Universality of Sparse Graph Classes

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

Who Knows Best What the Next Year Will Hold for You? The Validity of Direct and Personality‐based Predictions of Future Life Experiences Across Different Perceivers

open access: yesEuropean Journal of Personality, EarlyView., 2020
Abstract This study explored the validity of person judgements by targets and their acquaintances (‘informants’) in longitudinally predicting a broad range of psychologically meaningful life experiences. Judgements were gathered from four sources (targets, N = 189; and three types of informants, N = 1352), and their relative predictive validity was ...
Nele M. Wessels   +3 more
wiley   +1 more source

On Bipartite Biregular Large Graphs Derived From Difference Sets

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A bipartite graph G = ( V , E ) $G=(V,E)$ with V = V 1 ∪ V 2 $V={V}_{1}\cup {V}_{2}$ is biregular if all the vertices of each stable set, V 1 ${V}_{1}$ and V 2 ${V}_{2}$, have the same degree, r $r$ and s $s$, respectively. This paper studies difference sets derived from both Abelian and non‐Abelian groups.
Gabriela Araujo‐Pardo   +3 more
wiley   +1 more source

Aggregating distributed energy resources for grid flexibility services: A distributed game theoretic approach

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView., 2023
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy