Header menu link for other important links
X
Embedding complete bipartite graph into sibling trees with optimum wirelength
Published in Charles Babbage Research Centre
2020
Volume: 112
   
Pages: 115 - 125
Abstract
In this paper, we determine the wirelength of embedding complete bipartite graphs K2n-1, 2n-1into 1-rooted sibling tree ST1nand Cartesian product of 1-rooted sibling trees and paths. © 2020 Kansai University. All rights reserved.
About the journal
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
PublisherCharles Babbage Research Centre
ISSN08353026