3 research outputs found
The -matching sequencibility of complete graphs
Alspach [ Bull. Inst. Combin. Appl., 52 (2008), pp. 7-20] defined the maximal
matching sequencibility of a graph , denoted , to be the largest
integer for which there is an ordering of the edges of such that every
consecutive edges form a matching. Alspach also proved that . Brualdi et al. [ Australas. J. Combin.,
53 (2012), pp. 245-256] extended the definition to cyclic matching
sequencibility of a graph , denoted , which allows cyclical
orderings and proved that .
In this paper, we generalise these definitions to require that every
consecutive edges form a subgraph where every vertex has degree at most , and we denote the maximum such number for a graph by and
for the non-cyclic and cyclic cases, respectively. We conjecture
that and
and that both bounds are attained for
some and . We prove these conjectured identities for the majority of
cases, by defining and characterising selected decompositions of . We also
provide bounds on and as well as results on hypergraph
analogues of and
The -matching sequencibility of complete multi--partite -graphs
Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the
maximal matching sequencibility of a graph , denoted~, to be the
largest integer for which there is an ordering of the edges of such
that every consecutive edges form a matching. In this paper, we consider
the natural analogue for hypergraphs of this and related results and determine
where
denotes the multi--partite -graph
with edge multiplicity and parts of sizes ,
respectively. It turns out that these invariants may be given surprisingly
precise and somewhat elegant descriptions, in a much more general setting
The cyclic matching sequenceability of regular graphs
The cyclic matching sequenceability of a simple graph , denoted
, is the largest integer for which there exists a cyclic
ordering of the edges of so that every set of consecutive edges forms a
matching. In this paper we consider the minimum cyclic matching sequenceability
of -regular graphs. We completely determine this for -regular graphs, and
give bounds for .Comment: 24 pages, 1 figur