On the domination number and the total domination number of Fibonacci cubes
| Autor: | Elif Saygı |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Algebra and Number Theory
Optimization problem Fibonacci cube Degree (graph theory) Domination analysis Upper and lower bounds Theoretical Computer Science Combinatorics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Discrete Mathematics and Combinatorics Geometry and Topology Hypercube Integer programming MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Ars Mathematica Contemporanea. 16:245-255 |
| ISSN: | 1855-3974 1855-3966 |
| Popis: | Fibonacci cubes are special subgraphs of the hypercube graphs. Their domination numbers and total domination numbers are obtained for some small dimensions by integer linear programming. For larger dimensions upper and lower bounds on these numbers are given. In this paper, we present the up-down degree polynomials for Fibonacci cubes containing the degree information of all vertices in more detail. Using these polynomials we define optimization problems whose solutions give better lower bounds on the domination numbers and total domination numbers of Fibonacci cubes. Furthermore, we present better upper bounds on these numbers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|