Domination polynomials of the grid, the cylinder, the torus, and the king graph
From MaRDI portal
Publication:6635586
Publication date: 12 November 2024
Published in: Journal of Integer Sequences (Search for Journal in Brave)
algorithmtransfer matrixdominating setgrid graphdomination polynomialtorus graphcylinder graphking graph
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Special sequences and polynomials (11B83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms for dominating set
- Computing the domination number of grid graphs
- Characterization of graphs using domination polynomials
- Dominating sets and domination polynomials of paths
- Unit disk graphs
- The domination complexity and related extremal values of large 3D torus
- Number of dominating sets in cylindric square grid graphs
- Optimal domination polynomials
- Fehlerabschätzungen und Extrapolation mit rationalen Funktionen bei Verfahren vom Richardson-Typus
- The Domination Number of Grids
- Domination in Chessboards
- Introduction to Domination Polynomial of a Graph
- Exact site-percolation probability on the square lattice
- Topics in Domination in Graphs
- On the domination polynomials of friendship graphs
- The Domination Equivalence Classes of Paths
- Staircase words and Chebyshev polynomials
- The domination number of the king's graph
- Domination polynomial of the rook graph
- New bounds for matrix multiplication: from alpha to omega
This page was built for publication: Domination polynomials of the grid, the cylinder, the torus, and the king graph