On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
From MaRDI portal
Publication:5080284
DOI10.2298/FIL1901111OzbMath1499.05312OpenAlexW2990930757WikidataQ126640367 ScholiaQ126640367MaRDI QIDQ5080284
Publication date: 31 May 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1901111o
Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- On the roots of domination polynomial of graphs
- On the unimodality of independence polynomials of some graphs
- On the roots of edge cover polynomials of graphs
- On the edge cover polynomial of a graph
- Characterization of graphs using domination polynomials
- On the two largest \(Q\)-eigenvalues of graphs
- An extension of the bivariate chromatic polynomial
- An introduction to matching polynomials
- The vertex-cover polynomial of a graph
- Some results on the independence polynomial of unicyclic graphs
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Graphs cospectral with a friendship graph or its complement
- Cycles are determined by their domination polynomials
- On the domination polynomials of friendship graphs
- An introduction to chromatic polynomials
- A Contribution to the Theory of Chromatic Polynomials
- Chromatic Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
