✦ LIBER ✦

Spectral characterization of the Hamming graphs

✍ Scribed by Sejeong Bang; Edwin R. van Dam; Jack H. Koolen

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 123 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.10.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing subgraphs of Hamming grap

Characterizing subgraphs of Hamming graphs

✍ Sandi Klavžar; Iztok Peterin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph __G__ is an induced subgraph of a Hamming graph i

Retracts of Infinite Hamming Graphs

✍ Marc Chastand 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 282 KB

A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of Bandelt (1984,

Spectral characterizations of sandglass

Spectral characterizations of sandglass graphs

✍ Pengli Lu; Xiaogang Liu; Zhanting Yuan; Xuerong Yong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 633 KB

The sandglass graph is obtained by appending a triangle to each pendant vertex of a path. It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra.

Spectral characterizations of lollipop g

Spectral characterizations of lollipop graphs

✍ Willem H. Haemers; Xiaogang Liu; Yuanping Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The competition numbers of ternary Hammi

The competition numbers of ternary Hamming graphs

✍ Boram Park; Yoshio Sano 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 243 KB

It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano (in press) [16] gave the exact values of the competition numbers of Hamming graphs H(n, q) if 1 ≤ n ≤ 3 or 1 ≤ q ≤ 2. In this paper, we give an explicit formula for the competition numbers

A note on the spectral characterization

A note on the spectral characterization of -graphs

✍ F. Ramezani; N. Broojerdian; B. Tayfeh-Rezaie 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 145 KB