Geometry of minimum spanning trees on scale-free networks

DOI10.1016/j.physa.2003.08.031zbMath1027.05024OpenAlexW2050370193MaRDI QIDQ1412875

János Kertész, Gábor J. Szabó, Mikko J. Alava

Publication date: 30 November 2003

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2003.08.031

zbMATH Keywords

probability distributionscale-free graphsrandom edge weights

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (14)

Enumeration of spanning trees on contact graphs of disk packings ⋮ A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ Condensation phenomena in preferential attachment trees with neighbourhood influence ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Random growth networks with exponential degree distribution ⋮ Enumeration of spanning trees on Apollonian networks ⋮ Enumeration of spanning trees in planar unclustered networks ⋮ Co-Evolutive Models for Firms Dynamics ⋮ An ensemble of random graphs with identical degree distribution ⋮ Topological properties of a 3-regular small world network ⋮ Counting spanning trees in self-similar networks by evaluating determinants

Cites Work

• Counting Minimum Weight Spanning Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Geometry of minimum spanning trees on scale-free networks