Please use this identifier to cite or link to this item:
|Title:||Domination type parameters of Pell graphs||Authors:||Özer A.B.
integer linear programming
|Issue Date:||2023||Publisher:||Society of Mathematicians, Physicists and Astronomers of Slovenia||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. © 2023 Society of Mathematicians, Physicists and Astronomers of Slovenia. All rights reserved.||URI:||https://doi.org/10.26493/1855-3974.2637.f61
|Appears in Collections:||Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection|
Show full item record
checked on Dec 26, 2022
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.