Efficient proper embedding of a daisy cube
From MaRDI portal
Publication:5020294
DOI10.26493/1855-3974.2454.892zbMath1479.05230arXiv2006.08712OpenAlexW3181879875MaRDI QIDQ5020294
Publication date: 5 January 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.08712
Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles
- Generalized Fibonacci cubes
- Circular embeddability of isometric words
- Isometric embedding in products of complete graphs
- Isometric embeddings of subdivided connected graphs into hypercubes
- Cube-complements of generalized Fibonacci cubes
- Daisy cubes: a characterization and a generalization
- Daisy cubes and distance cube polynomial
- On domination-type invariants of Fibonacci cubes and hypercubes
- Resonance graphs of kinky benzenoid systems are daisy cubes
- On the domination number and the total domination number of Fibonacci cubes
- The parameters of Fibonacci and Lucas cubes
This page was built for publication: Efficient proper embedding of a daisy cube