SQUARE DIFFERENCE LABELING OF CIRCULANT NETWORK $ G(n;\pm \{1,2\}) $

V.J.A. Cynthia, P. Poorani

IJPAM: Volume 109, No. 7 (2016)

Title

SQUARE DIFFERENCE LABELING OF
CIRCULANT NETWORK $G(n;\pm \{1,2\})$

Authors

V. Jude Annie Cynthia

, P. Poorani

Department of Mathematics
Stella Maris College
Chennai, INDIA

Department of Mathematics
C.T.T.E College for Women
Chennai, INDIA

Abstract

A function f of a graph G(P,Q) admits square difference labeling if there exist a bijection $f:V(G)\rightarrow \left\lbrace 0,1,2,...p-1\right\rbrace$ such that the induced function $f^{*}:E(G)\rightarrow N$ given by $f^{*}(uv)=\left\vert (f(u))^{2}-(f(v))^{2}\right\vert$ for every $uv\in E(G)$ are all distinct. A graph which admits square difference labeling is called square difference graph. In this paper we investigate that the circulant network $G(n; \pm \left\lbrace 1,2 \right\rbrace ),n\ge 8$ is a square difference graph.

History

Received: October 1, 2016
Revised:
Published: February 20, 2017

AMS Classification, Key Words

AMS Subject Classification:
Key Words and Phrases: square difference labeling, square difference graph, circulant network

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: G. Amudha, Square difference labeling of graphs, Internatonal Journal of Mathematics Research, ISSN , 6(2), (2014), 191-204.
2: R. Beivide, E. Herrada, J.L. Balc azar, A. Arruabarrena, Optimal Distance Networks of Low Degree for Parallel Computers, IEEE Transactions on Computers, 40(10), (1991), 1109-1124.
3: J.C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer networks, A Survey Journal of Parallel and Distributed Computing, 24(1), (1995), 2-10.
4: F.T. Boesch, J. Wang, Reliable circulant networks with minimum transmission delay, IEEE Transactions on Circuit and Systems, 32(12), (1985), 1286-1291.
5: Indra Rajasingh, Paul Manuel, Bharati Rajan, Micheal Arokiaraj, Embedding of circulant network, Journal of combinatorial optimization , (2013).
6: J.A. Gallian, A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 17, (2010).
7: M. Karlin, New binary coding results by circulant, /it IEEE Transactions on Information Theory, 15(1), (1969), 81-92.
8: P.B. Sarasija, Square difference labeling of some union graphs, International Journal of Mathematics Trends and Technology, 11(2), (2014).
9: P.B. Sarasija, Square difference labeling for certain graph, International Journal of Mathematical Archive-4(8), 2013, 8(2), (2014), 115-121.
10: V. Sharon Philomena, Square and Cube difference labeling of cycle cactus, special tree and new Key graphs, Annals of Pure and Applied Mathematics, 8(2), (2014), 115-121.
11: J. Shiama, Square sum labeling for some middle and total graphs, International Journal of Computer Applications (0975-08887),37(4), (2012).
12: J. Shiama, Square difference labeling of some Path, Fan and Gear graph, International Journal of Scientific and Engineering Research, 4,(2013).
13: J. Shiama, Square difference labeling for some graphs, International Journal of Computer Applications (0975-08887), 44 (4), (2012).
14: R.S. Wilkov, Analysis and Design of Reliable Computer Networks, IEEE Trans. Communications, 20(3), (1972), 660-678.
15: G.K. Wong, D.A. Coppersmith, “A combinatorial problem related to multi module memory organization”. Journal of Association for Computing Machinery, 21, (1974), 392-401.
16: J. Xu, Topological Structure and Analysis of Interconnection Networks, Kluwer Academic Publishers, (2001).

How to Cite?

DOI: 10.12732/ijpam.v109i7.14 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: 2016
Volume: 109
Issue: 7
Pages: 109 - 113

$G(n;\pm \{1,2\})$ %22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.

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