Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials

DOI10.7146/MATH.SCAND.A-22864MaRDI QIDQ3457541zbMATH OpenOpenAlexFDO

Authors Yohannes Tadesse

Publication date 15 December 2015

Published in MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.4520

zbMATH Keywords

Hilbert seriesStanley-Reisner ring

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65)

Abstract: For a hypergraph $mathcalH$, we consider the edge-induced and vertex-induced subhypergraph polynomials and study their relation. We use this relation to prove that both polynomials are reconstructible, and to prove a theorem relating the Hilbert series of the Stanley-Reisner ring of the independent complex of $mathcalH$ and the edge-induced subhypergraph polynomial. We also consider reconstruction of some algebraic invariants of $mathcalH$.

Recommendations

• scientific article; zbMATH DE number 3893227
• Note on the subgraph component polynomial
• The edge Szeged polynomial of graphs
• scientific article; zbMATH DE number 6890347
• EDGECUT POLYNOMIAL OF GRAPHS
• Induced subgraphs of hypercubes
• On the matching polynomial of subdivision graphs
• scientific article; zbMATH DE number 3929064
• On the edge cover polynomial of a graph
• On coefficients of edge domination polynomial of a graph

Cited in

(4)

• Poincaré Series of some Hypergraph Algebras
• The Italian identities for Hilbert series of hypergraphs
• scientific article; zbMATH DE number 6890347 (Why is no real title available?)
• Fuzzy logic programs as hypergraphs. Termination results

This page was built for publication: Using Edge-Induced and Vertex-Induced Subhypergraph Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457541)