On connectivity polynomial of graphs

DOI10.1142/S1793830924500848MaRDI QIDQ6922492zbMATH OpenFDO

Authors Mohammad Reza Oboudi

Publication date 30 September 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500848

zbMATH Keywords

connectivity polynomialgraphnumber of connected induced subgraphs

Mathematics Subject Classification ID

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 determinant formula for the number of ways of coloring a map.
• An introduction to matching polynomials
• Cycles are determined by their domination polynomials.
• On the edge cover polynomial of a graph
• On the largest real root of independence polynomials of trees.
• On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
• On the rational independence roots
• On the roots of domination polynomial of graphs
• On the roots of edge cover polynomials of graphs
• Some results on the independence polynomial of unicyclic graphs
• The average domination polynomial of graphs is unimodal
• The vertex-cover polynomial of a graph

This page was built for publication: On connectivity polynomial of graphs

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