IJPAM: Volume 120, No. 1 (2018)

Title

MONOPHONIC WIRELENGTH OF CIRCULANT NETWORKS
INTO WHEELS AND FANS

Authors

K. Uma Samundesvari$^1$, G. Sindhuja Michael$^2$
$^1$Department of Mathematics
Noorul Islam Centre for Higher Education
Kumaracoil, 629 175, INDIA
$^2$Department of Mathematics
Ponjesly College of Engineering
Nagercoil, 629 003, INDIA

Abstract

This paper presents the monophonic wirelength of circulant graph into wheels and fans. Also we present a monophonic algorithm to find the monophonic wirelength of family of circulant graphs into wheels and fans. Our monophonic algorithm produces the monophonic wirelength and cover a wide range of interconnection networks.

History

Received: January 28, 2017
Revised: Jule 10, 2018
Published: August 13, 2018

AMS Classification, Key Words

AMS Subject Classification: 05C, 05C12
Key Words and Phrases: monophonic distance, embedding, wirelength, edge congestion

Download Section

Download paper from here.
You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.

Bibliography

1
Arokiaraj, Paul Manuel, Indra Rajasingh, Bharati Rajan, Wirelength of 1-fault Hamiltonian graphs into wheels and fans, Information Processing Letters, 111 (2011), 921-925.

2
S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Rottger, U. P.Schroeder, Embedding of hypercubes into grids, MFCS, Electronic Edition Springer, Lecture Notes in Computer Science, 1450 (1998), 693-701.

3
L. Bezrukov, Embedding complete trees into the hypercube, Discrete Applied Mathematics, 110, No. 2-3 (2001), 101-119.

4
F. Buckley and F. Harary, Distance in Graph, Addison Wesley, Redwood City, CA, 1990.

5
T. Dvorak, Dense sets and embedding binary trees into hypercubes, Discrete Applied Mathematics, 155, No. 4 (2007), 506-514.

6
F. Harary, Graph Theory, Addison Wesley, 1969.

7
Indra Rajasingh, Paul Manuel, M. Arockiaraj and Bharati Rajan, Embeddings of circulant networks, Journal of Combinatorial Optimization, 11, No. 3 (2011), 360-366.

8
Jasintha Quadras, S. Sarah Surya, Linear wirelength of circulant networks, International Journal of Pure and Applied Mathematics, 86, No. 6 (2013), 883-891.

9
P. Manuel, Minimum average congestion of enhanced and augmented byper-cube into complete binary tree, Discrete Applied Mathematics, 159, No. 5 (2010), 360-366.

10
P. Manuel, M. Arockiaraj, I. Rajasingh and B. Rajan, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Discrete Appl. Math., 159, No. 17 (2011), 2109-2116.

11
P. Manuel, I. Rajasingh, B. Rajan and H. Mercy, Exact wirelength of hypercube on a grid, Discrete Applied Mathematics, 157, No. 7 (2009), 1486-1495.

12
B.R. Myers, Number of spanning trees in a wheel, IEEE Transactions on Circuit Theory, 18 (1971), 280-282.

13
I. Rajasingh, J. Quadras, P.Manuel and A. William, Embedding of cycles and wheels into arbitrary trees,Networks, 44 (2004), 173-178.

14
A.P. Santhakumaran and P. Titus, Monophonic distance in graphs, Discrete Math. Algorithms Appl., 3, No. 2 (2011), 159-169.

How to Cite?

DOI: 10.12732/ijpam.v120i1.1 How to cite this paper?

Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2018
Volume: 120
Issue: 1
Pages: 1 - 9


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).