DocumentCode
3160408
Title
Notice of Violation of IEEE Publication Principles
A Pascal Graph Property and Computer Network Topology
Author
Pal, Sanjay Kumar ; Sarma, Samar Sen ; Neogi, Subhrendu Guha
Author_Institution
Dept. of Comput. Sci. & Applic., NSHM Coll. of Manage. & Technol., Kolkata, India
fYear
2009
fDate
27-29 Dec. 2009
Firstpage
151
Lastpage
154
Abstract
Notice of Violation of IEEE Publication Principles
"A Pascal Graph Property and Computer Network Topology,"
by S.K. Pal, S.S. Sarma, S.G. Neogi,
in the Proceedings of the First International Conference on Networks and Communications, 2009. NETCOM \´09, December 2009, pp.151-154
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:
"A New Property of Pascal Graph from the Perspective of Computer Network Topology"
by Somdev Chatterjee and Samar Sen Sarma,
in the International Journal of Computer Science and Information Technology (IJCSIT), Vol.1, 2007, pp. 14-20
It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.
"A Pascal Graph Property and Computer Network Topology,"
by S.K. Pal, S.S. Sarma, S.G. Neogi,
in the Proceedings of the First International Conference on Networks and Communications, 2009. NETCOM \´09, December 2009, pp.151-154
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:
"A New Property of Pascal Graph from the Perspective of Computer Network Topology"
by Somdev Chatterjee and Samar Sen Sarma,
in the International Journal of Computer Science and Information Technology (IJCSIT), Vol.1, 2007, pp. 14-20
It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.
Keywords
computer network reliability; graph theory; telecommunication network topology; Hypercube; Mesh; Pascal graph property; computer network topology; de-Bruijn; interconnection network; network reliability; Computer network management; Computer network reliability; Computer networks; Computer science; Hypercubes; Matrix converters; Multiprocessor interconnection networks; Network topology; Scalability; Symmetric matrices; Computer Network Topology; Dependable node of Pascal Graph; Pascal Graph; Pascal Matrix;
fLanguage
English
Publisher
ieee
Conference_Titel
Networks and Communications, 2009. NETCOM '09. First International Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4244-5364-1
Electronic_ISBN
978-0-7695-3924-9
Type
conf
DOI
10.1109/NetCoM.2009.24
Filename
5384019
Link To Document