Polynomial graph
M., et al.: The differential of the strong product graphs. Discrete Applied Mathematics, 232, 64–72 (2017)īermudo, S., De la Torre, L., Martín-Caraballo, A. Graphs and Combinatorics, 31(1), 91–98 (2015)īermudo, S.: On the Differential and Roman domination number of a graph with minimum degree two. Utilitas Mathematica, 103, 319–334 (2017)īeck, M., Blado, D., Crawford, J., et al.: On Weak Chromatic Polynomials of Mixed Graphs. M.: Bounds on the differential of a graph. A., Bermudo, S., Leañnos, J., et al.: β-Differential of a Graph. Discussiones Mathematicae Graph Theory, 20(1), 57–69 (2000)īasilio, L. L., Llano, B.: Mean value for the matching and dominating polynomial.
International Journal of Mathematical Analysis, 9(44), 2171–2180 (2015)Īrocha, J. H.: Characterization of graphs using domination polynomials. The On-Line Encyclopedia of Integer Sequences.Akbari, S., Alikhani, S., Peng, Y. Stanley, R.: A symmetric function generalization of the chromatic polynomial of a graph. Schmitt, W.R.: Hopf algebra methods in graph theory. In: Nonlinear Partial Differential Equations in Applied Science (Tokyo 1982), Norrth-Holland Mathematics Studies, vol. Sato, M., Sato, Y.: Soliton equations as dynamical systems on infinite dimensional Grassmann manifolds. Annali della Scuola Normale Superiore di Pisa Classe di Scienze, Série 4 25(3–4), 731–738 (1997) Rota, G.-C., Shen, J., Taylor, B.: All polynomials of binomial type are represented by Abel polynomials. Roman, S., Rota, G.-C.: The umbral calculus. Pitman, J.: Forest volume decompositions and Abel–Cayley–Hurwitz multinomial expansions.
Okounkov, A.: Toda equations for Hurwitz numbers. Noble, S., Welsh, D.: A weighted graph polynomial from chromatic invariants of knots. Lando, S.K.: On a Hopf algebra in graph theory. American Mathematical Society, Providence (1997)
#Polynomial graph series#
American Mathematical Society Translations: Series 2, 180, Adv. Lando, S. K.: On primitive elements in the bialgebra of chord diagrams. Krasilnikov, E.: Invariants of framed graphs and the Kadomtsev–Petviashvili hierarchy. Knill, O.: Counting rooted forests in a network. Kelmans, A.K., Chelnokov, V.N.: A certain polynomial of a graph and graphs with an extremal number of trees. Kazarian, M., Lando, S.: Combinatorial solutions to integrable hierarchies. Kadomtsev, B.B., Petviashvili, V.I.: On the stability of solitary waves in weakly dispersive media. Joni, S., Rota, G.-C.: Coalgebras and bialgebras in combinatorics. Goulden, I.P., Jackson, D.M.: The KP hierarchy, branched covers, and triangulations. arXiv:math/0602575 Ĭhmutov, S., Duzhin, S., Lando, S.: Vassiliev knot invariants III. AMS, Providence (2016)Ĭhebotarev, P., Shamis, E.: Matrix-Forest Theorems. (eds.) The Mathematical Legacy of Richard P. In: Herch, P., Lam, T., Pylyavskyy, P., Reiner, V. 142, 1–30 (2006)īilley, S., McNamara, P.: The contributions of Stanley to the fabric of symmetric and quasisymmetric functions. Journal für die reine und angewandte Mathematik 1, 159–160 (1826)Īguiar, M., Bergeron, N., Sottile, F.: Combinatorial Hopf algebras and generalized Dehn–Sommerville relations. Abel, N.H.: Beweis eines Ausdruckes, von welchem die Binomialformel ein einzelner Fall ist.