Pages that link to "Item:Q4982930"
From MaRDI portal
The following pages link to Introduction to Domination Polynomial of a Graph (Q4982930):
Displaying 46 items.
- On the roots of domination polynomial of graphs (Q266947) (← 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)
- Alliance polynomial of regular graphs (Q528552) (← links)
- Characterization of graphs using domination polynomials (Q709243) (← links)
- Complete \(r\)-partite graphs determined by their domination polynomial (Q897257) (← links)
- Dominating sets and domination polynomials of paths (Q1028883) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- The number of 2-dominating sets, and 2-domination polynomial of a graph (Q2030139) (← links)
- Number of dominating sets in cylindric square grid graphs (Q2042212) (← links)
- New network entropy : The domination entropy of graphs (Q2059882) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
- Optimal domination polynomials (Q2227988) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- Construction of dominating sets of certain graphs (Q2249929) (← links)
- On the structure of dominating graphs (Q2409507) (← links)
- On the unimodality of domination polynomials (Q2673493) (← links)
- On total edge fixed geodomination sets and polynomials of paths (Q2831145) (← links)
- On the graphs with four distinct domination roots (Q2885503) (← links)
- On the doubly connected domination polynomial of a graph (Q4966673) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)
- On the roots of total domination polynomial of graphs (Q5034559) (← links)
- The average domination polynomial of graphs is unimodal (Q5051450) (← links)
- On the domination polynomial of a digraph: a generation function approach (Q5065224) (← links)
- On coefficients of edge domination polynomial of a graph (Q5069790) (← links)
- TOTAL DOMINATION POLYNOMIAL OF SOME GRAPHS (Q5075612) (← links)
- (Q5076537) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- More on the unimodality of domination polynomial of a graph (Q5083860) (← links)
- A note on some parameters of domination on the edge neighborhood graph of a graph (Q5102393) (← links)
- (Q5106206) (← links)
- Domination polynomial of clique cover product of graphs (Q5130686) (← links)
- The Domination Equivalence Classes of Paths (Q5377030) (← links)
- The strong nonsplit domination polynomial of some graphs (Q5858161) (← links)
- (Q5886294) (← links)
- Categorifying connected domination via graph überhomology (Q6038540) (← links)
- (Q6046265) (← links)
- Unimodality and monotonic portions of certain domination polynomials (Q6098090) (← links)
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks (Q6098526) (← links)
- On the number of fair dominating sets of graphs (Q6101415) (← links)
- CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS (Q6115196) (← links)
- COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS (Q6170275) (← links)
- CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS (Q6170296) (← links)
- Restrained domination polynomial of join and corona of graphs (Q6174744) (← links)
- General position polynomials (Q6196217) (← links)