The average domination polynomial of graphs is unimodal (Q5051450): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.47443/dml.2021.0075 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210291434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs using domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles are determined by their domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge cover polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination polynomials of friendship graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2933520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Domination Polynomial of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the bivariate chromatic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average independence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of edge cover polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-sum representations of domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the independence polynomial of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the roots of domination polynomial of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unimodality of independence polynomials of some graphs / rank
 
Normal rank

Latest revision as of 22:01, 30 July 2024

scientific article; zbMATH DE number 7622509
Language Label Description Also known as
English
The average domination polynomial of graphs is unimodal
scientific article; zbMATH DE number 7622509

    Statements

    The average domination polynomial of graphs is unimodal (English)
    0 references
    23 November 2022
    0 references
    dominating set
    0 references
    domination polynomial
    0 references
    unimodal polynomial
    0 references
    log-concave polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references