Polynomial invariants of graphs
HTML articles powered by AMS MathViewer
- by Seiya Negami PDF
- Trans. Amer. Math. Soc. 299 (1987), 601-622 Request permission
Abstract:
We define two polynomials $f(G)$ and ${f^{\ast }}(G)$ for a graph $G$ by a recursive formula with respect to deformation of graphs. Analyzing their various properties, we shall discuss when two graphs have the same polynomials.References
- G. D. Birkhoff and D. C. Lewis, Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1946), 355–451. MR 18401, DOI 10.1090/S0002-9947-1946-0018401-4
- W. T. Tutte, Codichromatic graphs, J. Combinatorial Theory Ser. B 16 (1974), 168–174. MR 332549, DOI 10.1016/0095-8956(74)90060-4 —, Graph theory, Encyclopedia of Mathematics, vol. 21, Addison-Wesley, 1984.
- Hassler Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc. 34 (1932), no. 2, 339–362. MR 1501641, DOI 10.1090/S0002-9947-1932-1501641-2
- Hassler Whitney, 2-Isomorphic Graphs, Amer. J. Math. 55 (1933), no. 1-4, 245–254. MR 1506961, DOI 10.2307/2371127
Additional Information
- © Copyright 1987 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 299 (1987), 601-622
- MSC: Primary 05C99
- DOI: https://doi.org/10.1090/S0002-9947-1987-0869224-1
- MathSciNet review: 869224