Neighborhood and domination polynomials of graphs (Q1756089): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Characterization of graphs using domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean value for the matching and dominating polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartition polynomials, the Ising model, and domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topology of the independence complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs, shifted complexes, and graphical complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations and splitting formulas for the domination polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-sum representations of domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank

Revision as of 20:05, 17 July 2024

scientific article
Language Label Description Also known as
English
Neighborhood and domination polynomials of graphs
scientific article

    Statements

    Identifiers