Domination type parameters of Pell graphs
DOI:
https://doi.org/10.26493/1855-3974.2637.f61Keywords:
Pell graphs, Fibonacci cube, domination number, integer linear programmingAbstract
Pell graphs are defined on certain ternary strings as special subgraphs of Fibonacci cubes of odd index. In this work the domination number, total domination number, 2-packing number, connected domination number, paired domination number, and signed domination number of Pell graphs are studied. Using integer linear programming, exact values and some estimates for these numbers of small Pell graphs are obtained. Furthermore, some theoretical bounds are obtained for the domination numbers and total domination numbers of Pell graphs.
Downloads
Published
2022-09-12
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/