Graph Operations and Neighborhood Polynomials

Abstract The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G. In this paper, we investigate the behavior of this polynomial under several graph operations. Specifically, we provide an explicit formula for the neighborhood polynomial of the graph obtained from a given graph G by vertex attachment. We use this result to propose a recursive algorithm for the calculation of the neighborhood polynomial. Finally, we prove that the neighborhood polynomial can be found in polynomial-time in the class of k-degenerate graphs.

[1]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[2]  Bradley S. Gubser.  A Characterization of Almost-Planar Graphs , 1996, Combinatorics, Probability and Computing.

[3]  Artur Andrzejak,et al.  Splitting Formulas for Tutte Polynomials , 1997, J. Comb. Theory, Ser. B.

[4]  Bernardo Llano,et al.  Mean value for the matching and dominating polynomial , 2000, Discuss. Math. Graph Theory.

[5]  E. Weisstein.  Kneser's Conjecture , 2002 .

[6]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[7]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[8]  Jason I. Brown,et al.  The neighbourhood polynomial of a graph , 2008, Australas. J Comb..

[9]  Saieed Akbari,et al.  Characterization of graphs using domination polynomials , 2010, Eur. J. Comb..

[10]  Yoshio Okamoto,et al.  Dominating Set Counting in Graph Classes , 2011, COCOON.

[11]  Peter Tittmann,et al.  Domination Reliability , 2011, Electron. J. Comb..

[12]  Tomer Kotek,et al.  Recurrence Relations and Splitting Formulas for the Domination Polynomial , 2012, Electron. J. Comb..

[13]  P. Tittmann,et al.  Domination Polynomials of Graph Products , 2013, 1305.1475.

[14]  Tomer Kotek,et al.  Subset-Sum Representations of Domination Polynomials , 2012, Graphs Comb..

[15]  Markus Dod,et al.  The Independent Domination Polynomial , 2016, 1602.08250.

[16]  P. Tittmann,et al.  Counting Dominating Sets of Graphs , 2017, 1701.03453.

[17]  Gorjan Alagic,et al.  #p , 2019, Quantum information & computation.

[18]  Irene Heinrich,et al.  Neighborhood and Domination Polynomials of Graphs , 2018, Graphs Comb..