family of all maximal cliques of G. The edge-clique graph of G, Ke(G), is the. one whose vertices are the edges of G, two vertices being adjacent in Ke(G),.
確定！ 回上一頁
