Pages that link to "Item:Q5279281"
From MaRDI portal
The following pages link to On the domination polynomials of friendship graphs (Q5279281):
Displaying 15 items.
- The number of 2-dominating sets, and 2-domination polynomial of a graph (Q2030139) (← links)
- New network entropy : The domination entropy of graphs (Q2059882) (← links)
- (Q4583882) (← links)
- On the doubly connected domination polynomial of a graph (Q4966673) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)
- The average domination polynomial of graphs is unimodal (Q5051450) (← links)
- On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs (Q5080284) (← links)
- Domination polynomial of clique cover product of graphs (Q5130686) (← links)
- Graph polynomials for a class of DI-pathological graphs (Q5154578) (← links)
- (Q5269740) (← links)
- Domination Polynomials of certain hexagon lattice graphs (Q5862922) (← links)
- (Q5886294) (← links)
- Independent domination polynomial for the cozero divisor graph of the ring of integers modulo \(n\) (Q6561581) (← links)
- Domination polynomials of the grid, the cylinder, the torus, and the king graph (Q6635586) (← links)
- On the semitotal dominating sets of graphs (Q6670470) (← links)