Number of dominating sets in cylindric square grid graphs

DOI10.1007/s00373-021-02323-8zbMath1469.05079OpenAlexW3157039323MaRDI QIDQ2042212

Seungsang Oh

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02323-8

zbMATH Keywords

dominating setdomination polynomialcylindric square grid

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Counting dissections into integral squares

Uses Software

• OEIS

Cites Work

• Recurrence relations and splitting formulas for the domination polynomial
• Enumerating independent vertex sets in grid graphs
• Computing the domination number of grid graphs
• Topics on domination
• State matrix recursion method and monomer-dimer problem
• Dominating Cartesian products of cycles
• Quantum knots and the number of knot mosaics
• Maximal independent sets on a grid graph
• The Domination Number of Grids
• The domination numbers of the 5 × n and 6 × n grid graphs
• Introduction to Domination Polynomial of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Number of dominating sets in cylindric square grid graphs