C_4 decomposition of the tensor product of complete graphs

C_4 decomposition of the tensor product of complete graphs

Let G be a simple and finite graph. A graph is said to be decomposed into subgraphs H1 and H2 which is denoted by G = H1 ⊕ H2, if G is the edge disjoint union of H1 and H2. If G = H1 ⊕ H2 ⊕ H3 ⊕ ... ⊕ Hk, where H1, H2, H3, ..., Hk are all isomorphic to H, then G is said to be H-decomposable. Futherm...

Full description

Saved in:
Bibliographic Details
Main Authors: Oyewumi, Opeyemi; General Studies Department, Air Force Institute of Technology, Kaduna, Nigeria (Author), Akwu, Abolape Deborah; Department of Mathematics, Federal University of Agriculture, Makurdi, Nigeria (Author)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2020-04-01.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items