Domination type parameters of Pell graphs

Arda Buğra Özer; Elif Saygı; Zulfukar Saygı

doi:10.26493/1855-3974.2637.f61

Authors

Arda Buğra Özer Middle East Technical University, Turkey https://orcid.org/0000-0002-6505-7038
Elif Saygı Hacettepe University, Turkey https://orcid.org/0000-0001-8811-4747
Zulfukar Saygı TOBB University of Economics and Technology, Turkey https://orcid.org/0000-0002-7575-3272

DOI:

https://doi.org/10.26493/1855-3974.2637.f61

Keywords:

Pell graphs, Fibonacci cube, domination number, integer linear programming

Abstract

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.

Domination type parameters of Pell graphs

Authors

DOI:

Keywords:

Abstract

Downloads

Published

Issue

Section

License

Developed By

Information