Results 1 to 10 of about 332 (30)

A birational lifting of the Stanley-Thomas word on products of two chains [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of periodicity, orbit structure, and invariants.
Michael Joseph, Tom Roby
doaj   +1 more source

Efficacy and safety of 0.0584% hydrocortisone aceponate topical spray and systemic oclacitinib combination therapy in dogs with atopic dermatitis: a randomized, double‐blinded, placebo‐controlled trial

open access: yesVeterinary Dermatology, Volume 32, Issue 2, Page 119-e25, April 2021., 2021
Background – Oclacitinib is an effective systemic therapy for dogs with atopic dermatitis (AD). Few studies have evaluated concurrent topical treatment with oclacitinib in dogs. Objectives – To evaluate the efficacy and safety of combination therapy of oclacitinib and 0.0584% hydrocortisone aceponate (HCA) spray in dogs with AD.
Junko Takahashi   +9 more
wiley   +1 more source

On Semisymmetric Cubic Graphs of Order 20p2, p Prime

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215–232] that there is no semisymmetric graph of
Shahsavaran Mohsen   +1 more
doaj   +1 more source

On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq

open access: yesOpen Mathematics, 2022
A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article,
Ling Bo, Lan Ting, Ding Suyun
doaj   +1 more source

Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs

open access: yesForum of Mathematics, Sigma, 2023
We make precise and prove a conjecture of Klivans about actions of the sandpile group on spanning trees. More specifically, the conjecture states that there exists a unique ‘suitably nice’ sandpile torsor structure on plane graphs which is induced by ...
Ankan Ganguly, Alex McDonough
doaj   +1 more source

Generalized Andrásfai Graphs

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2022
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

Efficient Domination in Cayley Graphs of Generalized Dihedral Groups

open access: yesDiscussiones Mathematicae Graph Theory, 2022
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

Symmetry of Narayana Numbers and Rowvacuation of Root Posets

open access: yesForum of Mathematics, Sigma, 2021
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

An approach to Quillen’s conjecture via centralisers of simple groups

open access: yesForum of Mathematics, Sigma, 2021
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

Trees with Distinguishing Index Equal Distinguishing Number Plus One

open access: yesDiscussiones Mathematicae Graph Theory, 2020
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

Home - About - Disclaimer - Privacy