摘要
The undirected de Bruijn graph is often used as the model of communication network for its useful properties, such as short diameter, small maximum vertex degree. In this paper, we consider the alphabet overlap graph G（k, d, s）： the vertex set V = {v｜v = （v1...vk）; vi ∈ {1,2,... ,d}, i = 1,2,... ,k}; they are distinct and two vertices u = （ul...uk） and v = （vl... vk） are adjacent if and only if us＋i = vi or vs＋i = ui （i = 1,2,...,k - s）. In particular, when s = 1, G（k,d,s） is just an undirected de Bruijn graph. First, we give a formula to calculate the vertex degree of G（k, d, s）. Then, we use the corollary of Menger＇s theorem to prove that the connectivity of G（k, d, s） is 2d^s - 2d^2s-k for s ≥ k/2.
The undirected de Bruijn graph is often used as the model of communication network for its useful properties, such as short diameter, small maximum vertex degree. In this paper, we consider the alphabet overlap graph G（k, d, s）： the vertex set V = {v｜v = （v1...vk）; vi ∈ {1,2,... ,d}, i = 1,2,... ,k}; they are distinct and two vertices u = （ul...uk） and v = （vl... vk） are adjacent if and only if us＋i = vi or vs＋i = ui （i = 1,2,...,k - s）. In particular, when s = 1, G（k,d,s） is just an undirected de Bruijn graph. First, we give a formula to calculate the vertex degree of G（k, d, s）. Then, we use the corollary of Menger＇s theorem to prove that the connectivity of G（k, d, s） is 2d^s - 2d^2s-k for s ≥ k/2.
