Advanced Studies in Pure Mathematics

Spin Models and Almost Bipartite 2-Homogeneous Graphs

Kazumasa Nomura

Full-text: Open access


A connected graph of diameter $d$ is said to be almost bipartite if it contains no cycle of length $2\ell + 1$ for all $\ell < d$. An almost bipartite distance-regular graph $\Gamma = (X, E)$ is 2-homogeneous if and only if there are constants $\gamma_1, \ldots, \gamma_d$ such that $|\Gamma_{i-1}(u) \cap \Gamma_1(x) \cap \Gamma_1(y)| = \gamma_i$ holds for all $u \in X$ and for all $x, y \in \Gamma_i(u)$ with $\partial(x, y) = 2$ $\ (i=1, \ldots, d)$.

In this paper, almost bipartite 2-homogeneous distance-regular graphs are classified. This determines triangle-free connected graphs affording spin models (for link invariants) with certain weights.

Article information

Progress in Algebraic Combinatorics, E. Bannai and A. Munemasa, eds. (Tokyo: Mathematical Society of Japan, 1996), 285-308

Received: 10 April 1995
Revised: 7 June 1995
First available in Project Euclid: 15 August 2018

Permanent link to this document euclid.aspm/1534360737

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Nomura, Kazumasa. Spin Models and Almost Bipartite 2-Homogeneous Graphs. Progress in Algebraic Combinatorics, 285--308, Mathematical Society of Japan, Tokyo, Japan, 1996. doi:10.2969/aspm/02410285.

Export citation