Graph characterising polynomials

Discrete Mathematics

Volumn 206, Issue 1-3, 1999, Pages 171-178

  Parthasarathy, K R ^a  

^a IIT Colony   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038284446     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00403-8     Document Type: Article

References (11)

1. K. Balasubrahmanian, K.R. Parthasarathy, In search of a complete invariant for a graph, Combinatorics and Graph Theory, Proc. Symp. ISI Calcutta, 25-29 February 1980, Springer, Berlin, Lecture Notes in Maths, vol. 885, 1981, pp. 42-59.
2. A. Ben-Israel, T.N.E. Greville, Generalised Inverses: Theory and Applications, Wiley, New York, 1974.
3. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
4. L. Borzacchini, Characterization problem for G-graphs, Ars Combin. 24 B (1987) 231-237.
5. L. Borzacchini, Graphical partially ordered sets, Discrete Appl. Math. 18 (1987) 247-262.
6. E.J. Farrell, G.M. Constantine, On the reconstruction of the subgraph polynomial and the reconstruction conjecture, J. Math. Sci. 5 (1994) 1-9.
7. D.L. Greenwell, Reconstructing graphs, Proc. Amer. Math. Soc. 30 (1971) 431-433.
8. V.B. Mnukhin, The k-orbit reconstruction and the orbit algebra, Acta Appl. Math. 29 (1992) 83-117.
9. C.St.J.A. Nash-Williams, The reconstruction problem, Ch. 8 in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Academic Press, New York, 1978.
10. K.R. Parthasarathy, Basic Graph Theory, Tata McGraw-Hill, New Delhi, 1994.
11. W.T. Tutte, All the king's horses, in: J.A. Bondy, U.S.R. Murty (Eds.), Graph Theory and Related Topics, Academic Press, New York, 1979, pp. 15-33.