Skip to main content

A form invariant multivariable polynomial representation of graphs

Special Invited Addresses

Part of the Lecture Notes in Mathematics book series (LNM,volume 885)

Abstract

A generalized adjacency matrix (called “representation matrix”) is defined for a graph: the elements of this matrix are the edge labels. Treating these labels as independent variables, if the determinant is evaluated, the resulting multivariable polynomial parametrizes a graph. This serves as a basis to detect isomorphism, automorphism, subgraph isomorphism, and other graph properties.

Essentially, this paper exhibits the analogy that exists between forms among expressions and isomorphism among graphs. Consequently, many of the graph properties can be inferred from properties, such as symmetry, variable-separable-factorizability, and similarity of forms of the parametrizing polynomial.

It is shown how this formalism can be used for coding a graph. The decoding or reconstruction of a graph from its invariant polynomial code is also described. These will have many practical applications.

Key Words and Phrases

  • Representation polynomial
  • isomorphism
  • automorphism
  • line graph
  • complexity
  • variable-separable-factorization of polynomial

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.C. Read and D.G. Corneil, The graph isomorphism disease, J. Graph Theory, 1 (1977), 339–363.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. A. Mowshowitz, The adjacency matrix and the group of a graph, in New Directions in the Theory of Graphs, edited by F. Harary, Academic Press, 1973.

    Google Scholar 

  3. R.A. Bari and F. Harary, Graphs and Combinatorics, Lecture Notes in Mathematics 406, Springer Verlag, N.Y., 1974.

    MATH  Google Scholar 

  4. J. Turner, Generalized matrix functions and the graph isomorphism problem, Siam J. App. Math., 16 (1968), 520–526.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. J.F. Meyer, Algebraic isomorphism invariants for graphs of automata, in Graph Theory and Computing, edited by R.C. Read, Academic Press, N.Y., 1972.

    Google Scholar 

  6. B. Weisfeiler, On Construction and Identification of Graphs, Lecture Notes in Mathematics 558, Springer Verlag, N.Y., 1976.

    MATH  Google Scholar 

  7. W.K. Kim and R.T. Chien, Topological Analysis and Synthesis of Communication Networks, Columbia University Press, N.Y., 1962.

    MATH  Google Scholar 

  8. R.B. Ash, Topology and the solution of linear systems, J. Franklin Institute, 268 (1959), 453–463.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. P. Erdös and J. Spencer, Probabilistic Methods in Graph Theory, Academic Press, N.Y., 1973.

    Google Scholar 

  10. F. Harary and E. Palmer, Graphical Enumeration, Academic Press, N.Y., 1973.

    MATH  Google Scholar 

  11. S. Seshu and F.E. Hohn, Symmetric polynomials in Boolean Algebra, Proc. Symp. Theory Switching, Part II, Harvard University Press, Cambridge, Mass., 1959, 225–234.

    Google Scholar 

  12. D. Slepian, On the number of symmetry types of Boolean functions of n variables, Canad. J. Math., 5 (1953), 185–193.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. S.H. Caldwell, The recognition and identification of symmetric switching functions, Trans. A.I.E.E., 73 (1954), 593–599.

    Google Scholar 

  14. R. Gould, The application of graph theory to the synthesis of contact networks, Proc. Symp. Theory Switching, Part I, Harvard University Press, Cambridge, Mass., 1959, 244–292.

    Google Scholar 

  15. W. Semon, Matrix methods in the theory of switching, Proc. Symp. Theory Switching, Part II, Harvard University Press, Cambridge, Mass., 1959, 13–50.

    Google Scholar 

  16. E.G. Whitehead, Enumerative Combinatorics, Courant Institute Lecture Notes 1971–1972, New York University Press, N.Y., 1973.

    Google Scholar 

  17. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1971.

    MATH  Google Scholar 

  18. M. Dhurandhar, Finding vertex chromatic numbers (To be published).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Krishnamurthy, E.V. (1981). A form invariant multivariable polynomial representation of graphs. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092252

Download citation

  • DOI: https://doi.org/10.1007/BFb0092252

  • 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