Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon

Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon

<p>A <span class="math"><em>G</em></span>-decomposition of the complete graph <span class="math"><em>K</em><sub><em>n</em></sub></span> is a family of pairwise edge disjoint subgraphs of <span class=...

Full description

Bibliographic Details
Main Authors: Dalibor Froncek, O'Neill Kingston
Format: Article
Language:English
Published: InaCombS; Universitas Jember; dan Universitas Indonesia 2019-06-01
Series:Indonesian Journal of Combinatorics
Subjects:
graph decomposition
ρ-labeling
Online Access:http://www.ijc.or.id/index.php/ijc/article/view/75

Similar Items

Similar Items