Complexity of Some Duplicating Networks

• Main Authors: Mohamed R. Zeen El Deen, Walaa A. Aboamer
• Format: Article
• Language: English
• Published: IEEE 2021-01-01
• Series: IEEE Access
• Subjects: Complexity; recurrence relation; orthogonal polynomials; splitting graph; shadow graph
• Online Access: https://ieeexplore.ieee.org/document/9353480/

There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path and cycle, the total graph of the path, the cycle, and the wheel. Furthermore, we got an explicit formula for the splitting of a special family of graphs such as path, cycle, complete graph <inline-formula> <tex-math notation="LaTeX">$K_{n}$ </tex-math></inline-formula>, complete bipartite graph <inline-formula> <tex-math notation="LaTeX">$K_{n,n}$ </tex-math></inline-formula>, prism, diagonal prism, and the graphs obtained from the wheel and double wheel by splitting the vertices on their rim. Finally, an obvious formula for the complexity of <inline-formula> <tex-math notation="LaTeX">$k-$ </tex-math></inline-formula> shadow graph for some graphs such as the path, the cycle, the wheel, the complete graph, and the fan graph <inline-formula> <tex-math notation="LaTeX">$F_{n}$ </tex-math></inline-formula> has been obtained. These formulas have been discovered by employing techniques from linear algebra, orthogonal polynomials, and matrix theory.