Codes from the line graphs of complete multipartite graphs and PD-sets

The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are found. Key words: Codes, graphs, designs PACS: 05, 51, 94

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Jennifer D. Key, P. Seneviratne
• Keywords: Binary Codes, Complete Multipartite Graphs, DM 2007, Key Words