Pages that link to "Item:Q1028883"
From MaRDI portal
The following pages link to Dominating sets and domination polynomials of paths (Q1028883):
Displaying 21 items.
- On the domination polynomial of some graph operations (Q361577) (← links)
- The domination polynomial of a graph at \(-1\) (Q367055) (← links)
- Algebraic integers as chromatic and domination roots (Q446327) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- Characterization of graphs using domination polynomials (Q709243) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- Complete \(r\)-partite graphs determined by their domination polynomial (Q897257) (← links)
- Connected domination polynomial of graphs (Q1673572) (← links)
- Subset-sum representations of domination polynomials (Q2014717) (← links)
- New network entropy : The domination entropy of graphs (Q2059882) (← links)
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees (Q2113431) (← links)
- Construction of dominating sets of certain graphs (Q2249929) (← links)
- On the graphs with four distinct domination roots (Q2885503) (← links)
- (Q4581873) (← links)
- On coefficients of edge domination polynomial of a graph (Q5069790) (← links)
- (Q5106206) (← links)
- (Q5143276) (← links)
- The Domination Equivalence Classes of Paths (Q5377030) (← links)
- Domination Polynomials of certain hexagon lattice graphs (Q5862922) (← links)
- (Q5886294) (← links)
- THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS (Q6203973) (← links)