Independence number of de Bruijn graphs
From MaRDI portal
Publication:2497496
DOI10.1016/J.DISC.2005.10.032zbMATH Open1096.05039OpenAlexW1995382100MaRDI QIDQ2497496FDOQ2497496
Authors: Nicolas Lichiardopol
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.10.032
Recommendations
- The spectra of undirected de Bruijn graphs and an upper bound for their independence numbers
- On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
- scientific article; zbMATH DE number 2050882
- The independence number for de Bruijn networks and Kautz networks
- The maximum independent sets of de Bruijn graphs of diameter 3
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (9)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- On the connectivity of the De Bruijn graph
- The independence number for de Bruijn networks and Kautz networks
- Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering the de Bruijn graph
- Title not available (Why is that?)
- The maximum independent sets of de Bruijn graphs of diameter 3
This page was built for publication: Independence number of de Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497496)