Results 51 to 60 of about 763 (151)
Reading Research Quarterly, Volume 61, Issue 2, April/May/June 2026.This graphical abstract illustrates how three equity‐oriented theoretical frameworks—the Asset‐Based Integrated View of Reading (ABIVR), Culturally and Historically Responsive Literacy (CHRL), and Adaptive Teaching—guided 39 pre‐ and in‐service teachers in identifying opportunities for enrichment and designing equity‐oriented adaptations to the Road to
Bong Gee Jang, Kate Franz
wiley +1 more source
Automorphism groups and isomorphisms of Cayley digraphs
Discrete Mathematics, 1998 Let \(G\) be a finite group and \(S\) a subset of \(G\), not containing the identity element 1. The Cayley digraph \(X=\text{Cay} (G,S)\) is defined by \(V(X)=G\) and \(E(X)=\{(g,sg)\;|\;g\in G,\;s\in S\}\). A subset \(S\) of \(G\) is called a CI-subset of \(G\), if for any subset \(T\) of \(G\) with \(\text{Cay} (G,S)\) isomorphic to \(\text{Cay} (G,T)
openaire +2 more sources
Applied Stochastic Models in Business and Industry, Volume 42, Issue 2, March/April 2026.ABSTRACT The so‐called algorithmic bias is a hot topic in the decision‐making process based on Artificial Intelligence, especially when demographics, such as gender, age or ethnic origin, come into play. Frequently, the problem is not only in the algorithm itself, but also in the biased data that feed the algorithm, which is just the reflection of the ...
Elena M. De‐Diego +2 more
wiley +1 more source
Networks, Volume 87, Issue 2, Page 111-130, March 2026.ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum +2 more
wiley +1 more source
Finite digraphs with given regular automorphism groups
Periodica Mathematica Hungarica, 1978 We prove that, given an infinite group G there is a directed graph X such that its automorphism group A(X) is the regular representation of G. The proof uses combinatorial set theoretic arguments (Erdös-Rado partition calculus). One of the lemmas asserts that, if |G|>2κ then G contains a subset H of power κ+ satisfying x−1y=y−1z⇒x=z (x, y, z ∈ H ...
openaire +3 more sources
Elusive groups of automorphisms of digraphs of small valency
European Journal of Combinatorics, 2015 A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.
Michael Giudici +3 more
openaire +3 more sources
The conjugacy problem for automorphism groups of homogeneous digraphs
Contributions to Discrete Mathematics, 2017 We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous articles. In this article we complete the program, and establish a dichotomy theorem that this complexity is either ...
Samuel Coskey, Paul Ellis
openaire +2 more sources
The exponent of the primitive Cayley digraphs on finite Abelian groups
Discrete Applied Mathematics, 1997 Let \(S\) be the set of the central elements of a finite group \(G\). The authors find necessary and sufficient conditions for a Cayley digraph to be primitive. They also show that the exponent of a primitive Cayley digraph on an abelian group is \(n-1\), \([n/2]\), \([n/2] -1\), or does not exceed \([n/3] +1\).
Jian-Zhong Wang, Jixiang Meng
openaire +1 more source
The group of autotopies of a digraph [PDF]
Czechoslovak Mathematical Journal, 1971 openaire +1 more source
Digraphs Admitting Sharply Edge-transitive Automorphism Groups
European Journal of Combinatorics, 1987 A permutation group G on a set X is a sharply edge-transitive group (SETG) if there exists a directed graph (X,R) such that \(G\leq Aut(X,R)\) and G acts as a regular permutation group on R. Let \(K^ h_ m\) denote the directed graph whose vertex set is partitioned into h disjoint m-sets and any two vertices in distinct m-sets are joined in both ...
openaire +2 more sources