Note on the subgraph component polynomial
From MaRDI portal
Publication:406698
zbMath1298.05168arXiv1311.6856MaRDI QIDQ406698
Publication date: 9 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.6856
Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30)
Related Items
Inclusion-exclusion by ordering-free cancellation, An abstraction of Whitney's broken circuit theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new expression for matching polynomials
- The covered components polynomial: a new representation of the edge elimination polynomial
- Recurrence relations and splitting formulas for the domination polynomial
- The enumeration of vertex induced subgraphs with respect to the number of components
- Distinguishing graphs by their left and right homomorphism profiles
- Characterization of graphs using domination polynomials
- On the two largest \(Q\)-eigenvalues of graphs
- Many-to-many disjoint paths in faulty hypercubes
- The bivariate Ising polynomial of a graph
- Path partitions of hypercubes
- On the matching polynomial of subdivision graphs
- Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
- An extension of the bivariate chromatic polynomial
- A survey of the theory of hypercube graphs
- An introduction to matching polynomials
- Graphs determined by polynomial invariants
- On graphs determined by their Tutte polynomials
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- On the maximal connected component of hypercube with faulty vertices
- An introduction to chromatic polynomials
- A Contribution to the Theory of Chromatic Polynomials
