GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS-Reference-Cited by-同舟云学术

GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS

Published:2008-06 Issue:02 Volume:01 Page:147-156
ISSN:1793-5571
Container-title:Asian-European Journal of Mathematics
language:en
Short-container-title:Asian-European J. Math.

Author:

Bang S.¹,Koolen J. H.²

Affiliation:

1. Department of Mathematics, Pusan National University, Geumjeong Gu, Busan 609-735, Republic of Korea

2. Department of Mathematics, POSTECH, Hyoja-dong, Namgu, Pohang 790-784, Republic of Korea

Abstract

Let a connected graph Γ be locally disjoint union of at most three complete graphs and let Γ be cospectral with the Hamming graph H(3, q) (q ≥ 2). In this paper, we show that Γ is either the Hamming graph H(3, q) or the dual graph of H(3, 3) (i.e., the graph whose vertices are the triangles of H(3, 3) and two triangles are adjacent if they intersect).

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793557108000151

Reference8 articles.

1. Distance-Regular Graphs

2. Which graphs are determined by their spectrum?

3. Characterizing distance-regularity of graphs by the spectrum

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph;Discrete Applied Mathematics;2024-11

2. Geometric distance-regular graphs without 4-claws;Linear Algebra and its Applications;2013-01

3. A short proof of a theorem of Bang and Koolen;European Journal of Combinatorics;2010-07

4. Developments on spectral characterizations of graphs;Discrete Mathematics;2009-02

5. Developments on Spectral Characterizations of Graphs;SSRN Electronic Journal;2007