Searched for:
(1 - 1 of 1)
Wang, H. (author), Kooij, R.E. (author), Van Mieghem, P. (author)
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 , ..., KnD+1, where neighboring cliques are fully-interconnected. The class of graphs has diameter D and size N = ? 1?i?D+1ni. We prove that this class of graphs can achieve the maximal number of links, the minimum average hopcount, and more...
journal article 2010