On the chromatic polynomial and the domination number of k-Fibonacci cubes
From MaRDI portal
Publication:5099762
DOI10.3906/mat-2004-20zbMath1493.05227OpenAlexW3088646252MaRDI QIDQ5099762
Ömer Eğecioğlu, Elif Saygı, Zülfükar Saygı
Publication date: 26 August 2022
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-2004-20
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (1)
Cites Work
- Counting disjoint hypercubes in Fibonacci cubes
- Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Generalized Fibonacci cubes
- Cube polynomial of Fibonacci and Lucas cubes
- On generalized Fibonacci cubes and unitary transforms
- Structure of Fibonacci cubes: a survey
- Boundary enumerator polynomial of hypercubes in Fibonacci cubes
- Daisy cubes: a characterization and a generalization
- Daisy cubes and distance cube polynomial
- Pell graphs
- \(q\)-cube enumerator polynomial of Fibonacci cubes
- On domination-type invariants of Fibonacci cubes and hypercubes
- On the domination number and the total domination number of Fibonacci cubes
- The parameters of Fibonacci and Lucas cubes
- k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
- Unnamed Item
- Unnamed Item
This page was built for publication: On the chromatic polynomial and the domination number of k-Fibonacci cubes