The enumeration of vertex induced subgraphs with respect to the number of components

Inspired by the study of community structure in connection networks, we introduce the graph polynomial Q(G;x,y), the bivariate generating function which counts the number of connected components in induced subgraphs. We give a recursive definition of Q(G;x,y) using vertex deletion, vertex contraction and deletion of a vertex together with its neighborhood and prove a universality property. We relate Q(G;x,y) to other known graph invariants and graph polynomials, among them partition functions, the Tutte polynomial, the independence and matching polynomials, and the universal edge elimination polynomial introduced by I. Averbouch et al. (2008) [5]. We show that Q(G;x,y) is vertex reconstructible in the sense of Kelly and Ulam, and discuss its use in computing residual connectedness reliability. Finally we show that the computation of Q(G;x,y) is @?P-hard, but fixed parameter tractable for graphs of bounded tree-width and clique-width.

[1]  Marc Noy,et al.  Graphs determined by polynomial invariants , 2003, Theor. Comput. Sci..

[2]  Béla Bollobás,et al.  The interlace polynomial of a graph , 2004, J. Comb. Theory, Ser. B.

[3]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2005, TALG.

[4]  Johann A. Makowsky,et al.  Computing Graph Polynomials on Graphs of Bounded Clique-Width , 2006, WG.

[5]  Johann A. Makowsky,et al.  Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions , 2008, Theory of Computing Systems.

[6]  Lorenzo Traldi,et al.  A Subset Expansion of the Coloured Tutte Polynomial , 2004, Combinatorics, Probability and Computing.

[7]  J. Makowsky,et al.  A most general edge elimination graph polynomial , 2007, 0712.3112.

[8]  Klaus Sutner,et al.  Computing Optimal Assignments for Residual Network Reliability , 1997, Discret. Appl. Math..

[9]  Peter Tittmann,et al.  A new two-variable generalization of the chromatic polynomial , 2003, Discret. Math. Theor. Comput. Sci..

[10]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[11]  R. Diestel.  Graph Decompositions: A Study in Infinite Graph Theory , 1990 .

[12]  Johann A. Makowsky,et al.  An extension of the bivariate chromatic polynomial , 2010, Eur. J. Comb..

[13]  Johann A. Makowsky,et al.  Linear Recurrence Relations for Graph Polynomials , 2008, Pillars of Computer Science.

[14]  Johann A. Makowsky,et al.  A Most General Edge Elimination Polynomial , 2008, WG.

[15]  Duncan J. Watts,et al.  The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

[16]  S. Ulam.  A collection of mathematical problems , 1960 .

[17]  Johann A. Makowsky,et al.  Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas , 2008, J. Log. Comput..

[18]  Johann A. Makowsky,et al.  Complexity of the Bollobás-Riordan Polynomial , 2008, CSR.

[19]  Marc Noy,et al.  Recursively constructible families of graphs , 2004, Adv. Appl. Math..

[20]  Benedikt Löwe,et al.  Logical Approaches to Computational Barriers: CiE 2006 , 2007, J. Log. Comput..

[21]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[22]  Robert L. Hemminger,et al.  Graph reconstruction - a survey , 1977, J. Graph Theory.

[23]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[24]  Lorenzo Traldi,et al.  On the colored Tutte polynomial of a graph of bounded treewidth , 2006, Discret. Appl. Math..

[25]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[26]  Johann A. Makowsky,et al.  From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials , 2006, CiE.

[27]  Johann A. Makowsky,et al.  Counting truth assignments of formulas of bounded tree-width or clique-width , 2008, Discret. Appl. Math..

[28]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[29]  Bruno Courcelle,et al.  On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..

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

[31]  Johann A. Makowsky,et al.  Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width , 2001, SODA '01.

[32]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects , 2008, ICALP.

[33]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[34]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[35]  Marc Noy,et al.  On Graphs Determined by Their Tutte Polynomials , 2004, Graphs Comb..

[36]  Charles L. Suffel,et al.  A survey of some network reliability analysis and synthesis results , 2009 .

[37]  Y. Gurevich.  On Finite Model Theory , 1990 .

[38]  Johann A. Makowsky,et al.  From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials , 2008, Theory of Computing Systems.

[39]  Edward Allburn,et al.  Graph decomposition , 1990 .

[40]  J. A. Bondy,et al.  Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .

[41]  Christian Hoffmann,et al.  A Most General Edge Elimination Polynomial - Thickening of Edges , 2008, Fundam. Informaticae.

[42]  Markus Bläser,et al.  On the Complexity of the Interlace Polynomial , 2007, STACS.

[43]  Markus Bläser,et al.  Complexity of the Cover Polynomial , 2007, ICALP.

[44]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms , 2000, Random Struct. Algorithms.

[45]  Steven D. Noble,et al.  Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width , 1998, Combinatorics, Probability and Computing.

[46]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[47]  Artur Andrzejak,et al.  An algorithm for the Tutte polynomials of graphs of bounded treewidth , 1998, Discret. Math..

[48]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.