Path and Star Decomposition of Knodel and Fibonacci Digraphs

In broadcasting and gossiping, communication structures are modelled using graphs. In simplex model, a communication link sends messages in a particular direction. The simplex network is modelled by directed graphs. Certain Knodel graphs are optimal broadcast graphs. This article defines the two layer representation of Knodel digraphs and Fibonacci digraphs-both are symmetric regular bipartite digraphs. A Knodel digraph is a symmetric digraph produced by replacing each edge of an undirected Knodel graph by a symmetric pair of directed edges. A Fibonacci digraph is a symmetric digraph produced by replacing each edge of an undirected Fibonacci graph by a symmetric pair of directed edges. Decomposition of a given graph is the partitioning of edge set so that the given graph is split in to sub-structures. If all such sub-structures are isomorphic, the decomposition is isomorphic decomposition. The isomorphic decomposition of the Knodel digraphs and Fibonacci digraphs in to isomorphic paths and stars is presented. The star decomposition of both Knodel digraph and Fibonacci digraph leads to the decomposition of equi-bipartite complete digraphs in to two classes of stars.