A Graph Polynomial Arising from Community Structure (Extended Abstract)

DOI10.1007/978-3-642-11409-0_3zbMath1273.05109OpenAlexW2168206553MaRDI QIDQ5851091

Peter Tittmann, Ilia Averbouch, Johann A. Makowsky

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_3

zbMATH Keywords

computational complexitynumber of connected componentsTutte polynomialmatching polynomialindependence polynomialgraph polynomialvertex deletionbivariate generating functionvertex contractionsubset expansion formulauniversal edge elimination polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15)

Related Items (1)

An abstraction of Whitney's broken circuit theorem

This page was built for publication: A Graph Polynomial Arising from Community Structure (Extended Abstract)