Upper Bounds on the Domination and Total Domination Number of Fibonacci Cubes
One of the basic model for interconnection networks is the $n$-dimensional hypercube graph $Q_n$ and the vertices of $Q_n$ are represented by all binary strings of length $n$. The Fibonacci cube $\Gamma_n$ of dimension $n$ is a subgraph of $Q_n$, where the vertices correspond to those without two co...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Suleyman Demirel University
2017-08-01
|
| Series: | Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi |
| Subjects: | |
| Online Access: | http://dergipark.ulakbim.gov.tr/sdufenbed/article/view/5000208597 |