Networks with the Smallest Average Distance and the Largest Average Clustering

Details Networks with the Smallest Average Distance and the Largest Average Clustering Networks with the Smallest Average Distance and the Largest Average Clustering

2010-07-23

arxiv.org/abs/1007.4031v1

Biology

Quantitative Biology

Molecular Networks

Scientific paper

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance, ignoring their average clustering. The form of these graphs is shown with analytical arguments. Finally, we measure the sensitivity to rewiring of this architecture with respect to the clustering coefficient, and we devise a method to make these networks more robust with respect to vertex removal.

Affiliated with

Also associated with

No associations

Rating

Networks with the Smallest Average Distance and the Largest Average Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Networks with the Smallest Average Distance and the Largest Average Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Networks with the Smallest Average Distance and the Largest Average Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138408