Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Embedding complete bipartite graph into sibling trees with optimum wirelength
Berin Greeni A
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.
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Publisher
Charles Babbage Research Centre
ISSN
08353026
Authors (1)
Berin Greeni A
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Congestion of complete bipartite graph into multicyclic graph
Embedding complete bipartite graph into grid with optimum congestion and wirelength
Embedding complete bipartite graph into sibling trees with optimum wirelength
Embedding complete bipartite graphs into necklace graphs
Get all the updates for this publication
Follow