ISOMORPHIC DECOMPOSITION OF GRAPHS OF SEMI-PRIME SIZE

ISOMORPHIC DECOMPOSITION OF GRAPHS OF SEMI-PRIME SIZE

In this dissertation, we study the condition required for a graph of semi-prime size to have a Sn decomposition. We have considered the simplest cases with the semi-prime value as 15, which is the product of 3 and 5; graph being a tree; and S4 decomposition is considered. Any graph can be decomposed into subgraphs, but the subgraphs obtained after decomposition need not be isomorphic to each other. We discuss, under what conditions can a tree of size 15 be decomposed such that all the subgraphs obtained is isomorphic to S4.

H Nidhi

Mathematics