Number of dominating sets in cylindric square grid graphs
type: Item
instance of: scholarly article
title: Number of dominating sets in cylindric square grid graphs
zbMATH Open document ID: 1469.05079
author: Seungsang Oh
published in: Graphs and Combinatorics
publication date: 2021-07-28T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C31
zbMATH DE Number: 7375714
zbMATH Keywords: domination polynomial
zbMATH Keywords: dominating set
zbMATH Keywords: cylindric square grid
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: s00373-021-02323-8
OpenAlex ID: W3157039323
cites work: Computing the domination number of grid graphs
cites work: Introduction to Domination Polynomial of a Graph
cites work: The domination numbers of the 5 × n and 6 × n grid graphs
cites work: Q4326192
cites work: Q5461448
cites work: Q3758883
cites work: The Domination Number of Grids
cites work: Q4826286
cites work: Q4368728
cites work: Topics on domination
cites work: Q3680873
cites work: Dominating Cartesian products of cycles
cites work: Recurrence relations and splitting formulas for the domination polynomial
cites work: Q4862239
cites work: Maximal independent sets on a grid graph
cites work: State matrix recursion method and monomer-dimer problem
cites work: Enumerating independent vertex sets in grid graphs
cites work: Quantum knots and the number of knot mosaics
cites work: Q4443440
DOI: 10.1007/S00373-021-02323-8
description: scientific article; zbMATH DE number 7375714