Domination type parameters of Pell graphs
From MaRDI portal
Publication:5056829
DOI10.26493/1855-3974.2637.f61zbMath1504.05222OpenAlexW4221080504WikidataQ114040692 ScholiaQ114040692MaRDI QIDQ5056829
Elif Saygı, Arda Buğra Özer, Zülfükar Saygı
Publication date: 8 December 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.2637.f61
Integer programming (90C10) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Generalized Fibonacci cubes
- Structure of Fibonacci cubes: a survey
- Pell graphs
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- On domination-type invariants of Fibonacci cubes and hypercubes
- Results on the domination number and the total domination number of Lucas cubes
- On the chromatic polynomial and the domination number of k-Fibonacci cubes
- 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
This page was built for publication: Domination type parameters of Pell graphs