In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …

One of the outstanding advancements in electronic‐structure density‐functional methods is
the Sankey–Niklewski (SN) approach [Sankey and Niklewski, Phys. Rev. B 40, 3979 (1989)]; …

Evolution and Structure of the Internet | Guide books skip to main content ACM Digital Library
home ACM Association for Computing Machinery corporate logo Google, Inc. (search) …

We propose a general approach to the description of spectra of complex networks. For the
spectra of networks with uncorrelated vertices (and a local treelike structure), exact …

The brain is a complex network of neural interactions, both at the microscopic and
macroscopic level. Graph theory is well suited to examine the global network architecture of …

In this paper, we shall give a survey of applications of the theory of graph spectra to
Computer Science. Eigenvalues and eigenvectors of several graph matrices appear in …

Comparing graphs to determine the level of underlying structural similarity between them is
a widely encountered problem in computer science. It is particularly relevant to the study of …

Given a large and complex network, we would like to find the best partition of this network
into a small number of clusters. This question has been addressed in many different ways …

For many years the research community has attempted to model the Internet in order to
better understand its behaviour and improve its performance. Since much of the structural …

Symmetries are ubiquitous in real networks and often characterize network features and
functions. Here we present a generalization of network symmetry called latent symmetry …