Domination Polynomials of certain hexagon lattice graphs (Q5862922): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominatind sets and domination polynomials of certain graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs using domination polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the location of roots of independence polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of independence polynomials of well covered graphs / 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: Q5176264 / 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: Dominating sets and domination polynomials of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5376377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the corona of two graphs / rank
 
Normal rank

Latest revision as of 07:05, 28 July 2024

scientific article; zbMATH DE number 7487365
Language Label Description Also known as
English
Domination Polynomials of certain hexagon lattice graphs
scientific article; zbMATH DE number 7487365

    Statements