Multidecomposition and multipacking of complete graph into graph pair of order 6

Graduation Year

2016

Publication Date

2016

Comments

At the request of the author, this essay is not available for download. Bona fide researchers may consult it by visiting the University Archives in Tate Archives & Special Collections; contact archives@iwu.edu for details.

Abstract

We find both necessary and sufficient conditions for the existence of a (C6C overscore 6)-multidecomposition of the complete graph on n vertices. We also investigate maximum (C6C overscore 6)-multipackings of the complete graph, obtaining partial results.

Disciplines

Mathematics

This document is currently not available here.

Share

COinS