Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Circular wirelength of generalized petersen graphs
Indra Rajasingh
,
M. Arockiaraj
,
B. Rajan
,
P. Manuel
Published in World Scientific Publishing Co. Pte Ltd
2011
DOI:
10.1142/S0219265911003027
Volume: 12
Issue: 4
Pages: 319 - 335
Abstract
In this paper we formulate the Vertex Congestion Lemma leading to a new technique in computing the exact wirelength of an embedding. We compute the circular wirelength of generalized Petersen graphs by partitioning the vertices as well as the edges of cycles. Further we obtain the linear wirelength of circular ladders. Our algorithms produce optimal values in linear time. © 2011 World Scientific Publishing Company.
Topics:
Generalized Petersen graph
(57)%
57% related to the paper
and
Vertex (geometry)
(53)%
53% related to the paper
View more info for "
Circular wirelength of generalized petersen graphs
"
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Journal of Interconnection Networks
Publisher
World Scientific Publishing Co. Pte Ltd
ISSN
02192659
Authors (1)
Indra Rajasingh
Mathematics
School of Advanced Sciences
Chennai Campus
Recent publications
Investigating substructures in goal oriented online communities: Case study of Ubuntu IRC
Induced Matching Partition of Petersen and Circulant Graphs
Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
Metric dimension of directed graphs
Get all the updates for this publication
Follow