Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 703989, 4 pages
http://dx.doi.org/10.1155/2013/703989
Research Article

A Polynomial Representation and a Unique Code of a Simple Undirected Graph

1Department of Mathematics, Jadavpur University, Kolkata 700032, India
2Department of Pure Mathematics, University of Calcutta, Kolkata 700019, India

Received 30 June 2013; Accepted 29 July 2013

Academic Editors: E. Bannai, L. Clark, and D. S. Kim

Copyright © 2013 Shamik Ghosh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. Chakrabarty, S. Ghosh, T. K. Mukherjee, and M. K. Sen, “Intersection graphs of ideals of rings,” Discrete Mathematics, vol. 309, no. 17, pp. 5381–5392, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. B. D. McKay, “Practical graph isomorphism,” Congressus Numerantium, vol. 30, pp. 45–65, 1981. View at Google Scholar
  3. R. P. Stanley, Enumerative Combinatorics, Cambridge University Press, Cambridge, UK, 2011.
  4. S. G. Hartke and A. J. Radcliffe, “McKay's canonical graph labeling algorithm,” in Contemporary Mathematics, vol. 479, pp. 99–111, American Mathematical Society, Providence, RI, USA, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet