Results 11 to 20 of about 55 (53)
Efficient Domination in Cayley Graphs of Generalized Dihedral Groups
An independent subset D of the vertex set V of the graph Γ is an efficient dominating set for Γ if each vertex v ∈ V \ D has precisely one neighbour in D. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which
Caliskan Cafer +3 more
doaj +1 more source
In this paper, we introduce a new family of circulants GA(t, k), called Generalized Andrásfai graphs, where t, k ≥ 2 are integers. We study various parameters like diameter, girth, domination number etc. of GA(t, k).
Biswas Sucharita +2 more
doaj +1 more source
Symmetry of Narayana Numbers and Rowvacuation of Root Posets
For a Weyl group W of rank r, the W-Catalan number is the number of antichains of the poset of positive roots, and the W-Narayana numbers refine the W-Catalan number by keeping track of the cardinalities of these antichains.
Colin Defant, Sam Hopkins
doaj +1 more source
Trees with Distinguishing Index Equal Distinguishing Number Plus One
The distinguishing number (index) D(G) (D′ (G)) of a graph G is the least integer d such that G has an vertex (edge) labeling with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid +3 more
doaj +1 more source
Rowmotion and generalized toggle groups [PDF]
We generalize the notion of the toggle group, as defined in [P. Cameron-D. Fon-der-Flaass '95] and further explored in [J. Striker-N. Williams '12], from the set of order ideals of a poset to any family of subsets of a finite set.
Jessica Striker
doaj +1 more source
An approach to Quillen’s conjecture via centralisers of simple groups
For any given subgroup H of a finite group G, the Quillen poset ${\mathcal {A}}_p(G)$ of nontrivial elementary abelian p-subgroups is obtained from ${\mathcal {A}}_p(H)$ by attaching elements via their centralisers in H.
Kevin Iván Piterman
doaj +1 more source
Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture
One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995): consider a plane partition P in an $a \times b \times c$ box ${\sf B}$ . Let $\Psi (P)$
Rebecca Patrias, Oliver Pechenik
doaj +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
THE EXPECTED JAGGEDNESS OF ORDER IDEALS
The jaggedness of an order ideal $I$ in a poset $P$ is the
MELODY CHAN +3 more
doaj +1 more source
Piecewise-linear promotion and RSK in rectangles and moon polyominoes [PDF]
We study piecewise-linear and birational lifts of Schützenberger promotion, evacuation, and the RSK correspondence defined in terms of toggles. Using this perspective, we prove that certain chain statistics in rectangles shift predictably under the ...
Liu, Ricky Ini +3 more
core +1 more source

