11 citations · 28 across the 15 of their papers we have counts for
5 papers · 1 filter
Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees
Mark Dukes, Thomas Selig, Jason P. Smith +1
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurr…
The Abelian sandpile model on Ferrers graphs -- A classification of recurrent configurations
Mark Dukes, Thomas Selig, Jason P. Smith +1
We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are…
The poset of graphs ordered by induced containment
Jason P. Smith
We study the poset of all unlabelled graphs, up to isomorphism, with if occurs as an induced subgraph in . We present some general results on the Möbi…
Modular Decomposition of Graphs and the Distance Preserving Property
Emad Zahedi, Jason P. Smith
Given a graph , a subgraph is isometric if for every pair , where is the distance function. A graph is distance preserving (dp) if…
The Poset of Mesh Patterns
Jason P. Smith, Henning Ulfarsson
We introduce the poset of mesh patterns, which generalises the permutation pattern poset. We fully classify the mesh patterns for which the interval [1^\emptyset,m] is non-pure, wh…