Disconnected vertex sets and equidistant code pairs

zbMATH Open0885.05083MaRDI QIDQ1378495FDOQ1378495

Willem H. Haemers

Publication date: 12 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119258

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

eigenvaluesHamming distancewordsmatrixHamming schemealphabetassiciation schemedisconnected setsequidistant code pair

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)

Cited In (4)

• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
• Two extremal problems on intersecting families
• Bicliques and eigenvalues
• Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces

   Recommendations

• Disjoint homometric sets in graphs 👍 👎
• Equidistant families of sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Graph Theoretic Methods in Coding Theory 👍 👎

This page was built for publication: Disconnected vertex sets and equidistant code pairs

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