Skip to main content
Conference ProceedingsOPEN ACCESS

Spectral properties of adjacency and distance matrices for various networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5102 LNCS(PART 2) 559-567
DOI: 10.1007/978-3-540-69387-1_64
2Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert-Barabási) and classical random ones (Erdos-Rényi) are evaluated. The graph spectra for dense graph in the Erdos-Rényi model are derived analytically. © 2008 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Malarz, K. (2008). Spectral properties of adjacency and distance matrices for various networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5102 LNCS, pp. 559–567). https://doi.org/10.1007/978-3-540-69387-1_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free