WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS

DOI10.1142/S0218348X22501092MaRDI QIDQ5044603

Yan Liu, Meifeng Dai, Yuanyuan Guo

Publication date: 2 November 2022

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

average trapping timeaverage shortest weighted pathweight-dependent walksweighted iterated friendship graphs

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Comparison of multiple random walks strategies for searching networks
• When local and global clustering of networks diverge
• Proof of conjectures on adjacency eigenvalues of graphs
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Mean first-passage times for two biased walks on the weighted rose networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Graphs cospectral with a friendship graph or its complement
• Interplay between collective behavior and spreading dynamics on complex networks
• Mapping Koch curves into scale-free small-world networks
• The Structure and Function of Complex Networks
• The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
• TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Spectral analysis for weighted iterated q-triangulation networks
• Impact of degree heterogeneity on the behavior of trapping in Koch networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS