Abstract
Complex networks, such as small world networks, are the focus of recent interest because of their potential as models for the interaction networks of complex systems. Most of the well-known models of small world networks are stochastic. The randomness makes it more difficult to gain a visual understanding of how networks are shaped, and how different vertices relate to each other. In this paper, we present and study a method for constructing deterministic small worlds using the line graph operator. This operator introduces cliques at every vertex of the original graph, which may imply larger clustering coefficients. On the other hand, this operator can increase the diameter at most by one and assure the small world property.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
