On the domination polynomial of a digraph: a generation function approach
From MaRDI portal
Publication:5065224
DOI10.22199/issn.0717-6279-4684zbMath1491.05141OpenAlexW3217497790MaRDI QIDQ5065224
Jorge Alencar, Leonardo Silva de Lima
Publication date: 18 March 2022
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22199/issn.0717-6279-4684
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- Characterization of graphs using domination polynomials
- Dominating sets in directed graphs
- On the out-domination and in-domination numbers of a digraph
- Introduction to Domination Polynomial of a Graph
This page was built for publication: On the domination polynomial of a digraph: a generation function approach