Cyclic Matching Sequencibility of Graphs

Details Cyclic Matching Sequencibility of Graphs Cyclic Matching Sequencibility of Graphs

2011-09-29

arxiv.org/abs/1109.6521v1

Mathematics

Combinatorics

Scientific paper

We define the cyclic matching sequencibility of a graph to be the largest
integer $d$ such that there exists a cyclic ordering of its edges so that every
$d$ consecutive edges in the cyclic ordering form a matching. We show that the
cyclic matching sequencibility of $K_{2m}$ and $K_{2m+1}$ equal $m-1$.

Affiliated with

Also associated with

No associations

Rating

Cyclic Matching Sequencibility of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cyclic Matching Sequencibility of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclic Matching Sequencibility of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151985