The spectra of Knödel graphs

MaRDI QIDQ3418608zbMATHFDO

Authors Hovhannes A. Harutyunyan, Calin D. Morosan

Publication date 5 February 2007

zbMATH Keywords

broadcast graphsCayley graph structuregossip graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A survey on Knödel graphs.
• On the minimum path problem in Knödel graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• Edge disjoint Hamilton cycles in Knödel graphs
• Recognizing Knödel graphs

Cited in

(15)

• Spectral properties of \(KK^j_n\) graphs
• Tight bound on the diameter of the Knödel graph
• On the minimum path problem in Knödel graphs
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• Diameter of General Knödel Graphs
• Upper bounds on the broadcast function using minimum dominating sets
• On the spectra of simplicial rook graphs
• A new construction of broadcast graphs
• Recognizing Knödel graphs
• A survey on Knödel graphs.
• Integer indices and spectral properties for the \(KK_n^j\) graphs
• The shortest path problem in the Knödel graph
• Spectral extremal graphs for the bowtie
• The spectra of arrangement graphs
• Eigenvalues of Cayley graphs

This page was built for publication: The spectra of Knödel graphs

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