POLYNOMIAL GRAPH SERIES

Utilitas Mathematica, 69, 43–54 (2006)ĭe Mier, A., Noy, M.: On graphs determined by their Tutte polynomials. European Journal of Combinatorics, 41, 1–19 (2014) K.: On the location of roots of graph polynomials. European Journal of Combinatorics, 41, 47–67 (2014) A.: Recurrence relations for graph polynomials on bi-iterative families of graphs. Hoede, C., Li, X.: Clique polynomials and independent set polynomials of graphs. Gutman, I., Harary, F.: Generalizations of the matching polynomial. D., Gutman, I.: On the theory of the matching polynomial. A.: Generalised domination and independence in graphs.

POLYNOMIAL GRAPH SERIES

Journal of Combinatorial Theory, Series B, 27, 75–86 (1979) J.: An introduction to matching polynomials. Discrete Mathematics and Theoretical Computer Science, 6, 69–90 (2003)įarrell, E. Electronic Notes in Discrete Mathematics, 46, 313–320 (2014)ĭohmen, K., Pönitz, A., Tittmann, P.: A new two-variable generalization of the chromatic polynomial. M., et al.: Distinctive power of the alliance polynomial for regular graphs.

M., et al.: Computing the alliance polynomial of a graph. C., Rosario, O., et al.: Computing the strong alliance polynomial of a graph. Discrete Applied Mathematics, 225, 22–32 (2017)Ĭarballosa, W., Hernández-Gómez, J. M., et al.: Alliance polynomial of regular graphs. J.: Roots of Independence Polynomials of Well Covered Graphs. D.: A determinant formula for the number of ways of coloring a map. Applicable Analysis and Discrete Mathematics, 8(1), 155–171 (2014)īermudo, S., Rodríguez, J. M.: The differential and the roman domination number of a graph. Theoretical Computer Science, 562, 330–345 (2015)īermudo, S., Fernau, H., Sigarreta, J. Discrete Applied Mathematics, 165, 69–82 (2014)īermudo, S., Fernau, H.: Combinatorics for smaller kernels: the differential of a graph. Discrete Mathematics, 312, 3236–3250 (2012)īermudo, S., Fernau, H.: Computing the differential of a graph: hardness, approximability and exact algorithms. International Journal of Computer Mathematics, 92(6), 1124–1134 (2015)īermudo, S., Fernau, H.: Lower bound on the differential of a 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.

Polynomial graph