Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.