On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs

DOI10.2298/FIL1901111OMaRDI QIDQ5080284zbMATH OpenOpenAlexWikidataFDO

Authors Mohammad Reza Oboudi

Publication date 31 May 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1901111o

zbMATH Keywords

edge cover polynomialedge coveringfriendship graphsperfect matchingunimodal

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• An extension of the bivariate chromatic polynomial
• An introduction to chromatic polynomials
• An introduction to matching polynomials
• Characterization of graphs using domination polynomials
• Chromatic Polynomials
• Cycles are determined by their domination polynomials.
• Graph theory
• Graphs cospectral with a friendship graph or its complement
• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 166023 (Why is no real title available?)
• scientific article; zbMATH DE number 568836 (Why is no real title available?)
• scientific article; zbMATH DE number 6423767 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• On the domination polynomials of friendship graphs
• On the edge cover polynomial of a graph
• On the largest real root of independence polynomials of trees.
• On the rational independence roots
• On the roots of domination polynomial of graphs
• On the roots of edge cover polynomials of graphs
• On the two largest Q-eigenvalues of graphs
• On the unimodality of independence polynomial of certain classes of graphs
• On the unimodality of independence polynomials of some graphs
• On the zeros of domination polynomial of a graph
• Some results on the independence polynomial of unicyclic graphs
• Symmetry and unimodality of independence polynomials of path-like graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The vertex-cover polynomial of a graph
• Unimodality of some independence polynomials via their palindromicity
• Uniqueness of the matching polynomial

Cited in

(2)

• The average domination polynomial of graphs is unimodal
• On connectivity polynomial of graphs

This page was built for publication: On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs

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