Abstract
Let A be the adjacency matrix of an ordinary (simple) graph G and A′=xI+λA+(J-A-I) where I is the n×n identity matrix and J is the n×n matrix of l’s. Then we call P(x,λ)=Per(A′) the permanent polynomial of G. A frame (2-matching) of a graph G is a spanning subgraph F of G whose components are single points, single lines, paths or cycles. If F has wi paths Pi, i=1,…,n and yj cycles Cj we let \(w(F) = \mathop \Pi \limits_{i = 1}^n p_i ^{w_i } \mathop \Pi \limits_{j = 3}^n c_j ^{y_j }\) the weight of F and call \(F(p,c) = \mathop \sum \limits_{F\varepsilon \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{F} } } w(F)\), where \(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{F} }\) is the family of all frames of G, the frame polynomial of G. We conjecture that either of these is a complete invariant for graphs, show their interrelation and present some evidence why the conjectures are plausible.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and Hypergraphs, Second Edition, North Holland, Amsterdam, 1976.
E.J. Farrell, On a general class of graph polynomials, J. Comb. Theory, B, 26 (1979), 111–122.
F. Harary, Graph Theory, Addison-Wesley, 1969.
H. Minc, Permanents, Addison-Wesley, 1978.
R.C. Read, Teaching graph theory to a computer, in Recent progress in combinatorics (W.T. Tutte Ed.), Academic Press, 1969, 161–174.
H.J. Ryser, Combinatorical Mathematics, Carus Monographs No. 14, 1963.
Y. Shah, G.I. Davida and M.K. McCarthy, Optimum features and graph isomorphism, IEEE Transactions Sys. Man and Gyb, SMC 4 (1974), 313–319.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Balasubramanian, K., Parthasarathy, K.R. (1981). In search of a complete invariant for graphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092254
Download citation
DOI: https://doi.org/10.1007/BFb0092254
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive