On the diameter of the generalized undirected de Bruijn graphsUGB(n,m),n2<m≤n3

DOI10.1002/NET.20228zbMATH Open1151.05017OpenAlexW851464173MaRDI QIDQ3548717FDOQ3548717

Authors: Jyhmin Kuo, Hung-Lin Fu 

Publication date: 17 December 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20228

Recommendations

• On the diameter of the generalized undirected de Bruijn graphs.
• The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)
• Wide diameters of de Bruijn graphs
• 2-diameter of de Bruijn graphs
• On \(m\)-restricted edge connectivity of undirected generalized De Bruijn graphs
• On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
• The maximum independent sets of de Bruijn graphs of diameter 3
• The spectra of undirected de Bruijn graphs and an upper bound for their independence numbers
• On the diameter of generalized Kneser graphs
• New bounds on the decycling number of generalized de Bruijn digraphs

zbMATH Keywords

diameterundirected graphgeneralized de Bruijn graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12)

Cites Work

• Design to Minimize Diameter on Building-Block Network
• Generalized de Bruijn digraphs
• Wide diameters of Cartesian product graphs and digraphs

Cited In (4)

• On the diameter of the generalized undirected de Bruijn graphs.
• On the twin domination number in generalized de Bruijn and generalized Kautz digraphs
• An unoriented variation on de Bruijn sequences
• The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)

This page was built for publication: On the diameter of the generalized undirected de Bruijn graphsUG_B(n,m),n²<m≤n³

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548717)