Vertex-connectivity of Hamming graphs

For positive integers n, m the graph H (m,n) is the graph with the vertex set ot all vectors (X1, X2, …, Xn) that X1 ∈ {0,1,2,…,m-},1≤i≤n and two vertices x and y are joined by an edge whenever they are distinct only in one component. In this paper, we prove that the graph H (m,n) is a Cartesian power of complete graph Km and get connectivity number of H (m,n).

کلیدواژه ها:

connectivity ، Hamming graph