On domination-type invariants of Fibonacci cubes and hypercubes
DOI10.26493/1855-3974.1172.BAEzbMATH Open1393.05196OpenAlexW2776455537WikidataQ129391364 ScholiaQ129391364MaRDI QIDQ4577877FDOQ4577877
Authors: Jernej Ayarija, Sandi Klavžar, Yoomi Rho, Seungbo Sim
Publication date: 3 August 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1172.bae
Recommendations
- The domination number of Fibonacci cubes
- On the domination number and the total domination number of Fibonacci cubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- The parameters of Fibonacci and Lucas cubes
- The larger bound on the domination number of Fibonacci cubes and Lucas cubes
Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Linear codes (general theory) (94B05)
Cites Work
- Title not available (Why is that?)
- Total domination in graphs
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Structure of Fibonacci cubes: a survey
- The degree sequence of Fibonacci and Lucas cubes
- The domination number of Fibonacci cubes
- Routing linear permutations on Fibonacci and Lucas cubes
- Cubic graphs with large ratio of independent domination number to domination number
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Counting disjoint hypercubes in Fibonacci cubes
- Title not available (Why is that?)
- The parameters of Fibonacci and Lucas cubes
- Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes
- Independent domination in hypercubes
- (Total) domination in prisms
- Title not available (Why is that?)
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Bounds on the connected domination number of a graph
- Total dominator coloring in product graphs
- New bounds on the signed domination numbers of graphs
- The (non-)existence of perfect codes in Fibonacci cubes
Cited In (13)
- On the chromatic polynomial and the domination number of \(k\)-Fibonacci cubes
- The parameters of Fibonacci and Lucas cubes
- Fibonacci-run graphs. II: Degree sequences
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- The number of short cycles in Fibonacci cubes
- Efficient proper embedding of a daisy cube
- Fibonacci-run graphs. I: Basic properties
- Results on the domination number and the total domination number of Lucas cubes
- On the domination number and the total domination number of Fibonacci cubes
- Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
- Domination type parameters of Pell graphs
- The domination number of Fibonacci cubes
- The larger bound on the domination number of Fibonacci cubes and Lucas cubes
This page was built for publication: On domination-type invariants of Fibonacci cubes and hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577877)