ScholarLens Back to search
2016•Digital Commons at Illinois Wesleyan University (Illinois Wesleyan University)Requires access

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

Yizhe Gao

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Combinatorics, Graph, Mathematics, Computer science, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Multidecomposition and multipacking of complete graph into graph pair of order 6 — Research Paper | ScholarLens