On the construction of most reliable networks Academic Article

abstract

• The construction of most reliable networks is investigated. In particular, the study of restricted edge connectivity shows that general Harary graphs are max-minmi for all i=, +1,...,2-3. As a consequence, this implies that for each pair of positive integers n and e, there is a graph of n vertices and e edges that is max-minmi for all i=,+1,...,2-3. General Harary graphs that are max-minmi for all i=,+1,...,2-2 are also constructed. 2003 Published by Elsevier B.V.

authors

• Chen, Jianer

published proceedings

• Discrete Applied Mathematics

author list (cited authors)

• Deng, H., Chen, J., Li, Q., Li, R., & Gao, Q.

citation count

• 17

complete list of authors

• Deng, Hanyuan||Chen, Jianer||Li, Qiaoliang||Li, Rongheng||Gao, Qiju

publication date

• May 2004

publisher

• Elsevier  Publisher

published in

• DISCRETE APPLIED MATHEMATICS  Journal

Digital Object Identifier (DOI)

• 10.1016/j.dam.2003.06.003

start page

• 19

end page

• 33

volume

• 140

issue

• 1-3

URL

• http://dx.doi.org/10.1016/j.dam.2003.06.003