Pages that link to "Item:Q414715"
From MaRDI portal
The following pages link to The communicability distance in graphs (Q414715):
Displaying 17 items.
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis (Q1740109) (← links)
- Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) (← links)
- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix (Q2093511) (← links)
- Network bipartitioning in the anti-communicability Euclidean space (Q2131522) (← links)
- Proof of a conjecture on communicability distance sum index of graphs (Q2132521) (← links)
- A spectral method to detect community structure based on the communicability modularity (Q2164584) (← links)
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic (Q2201378) (← links)
- ``Melting'' of complex networks. A mathematical model of complex networks resilience to external stress (Q2286091) (← links)
- A few examples and counterexamples in spectral graph theory (Q2296012) (← links)
- Some bounds for total communicability of graphs (Q2418987) (← links)
- Communicability Angle and the Spatial Efficiency of Networks (Q2832109) (← links)
- Predicting Triadic Closure in Networks Using Communicability Distance Functions (Q2943520) (← links)
- Effective Resistance Preserving Directed Graph Symmetrization (Q4615300) (← links)
- Where to cut to delay a pandemic with minimum disruption? mathematical analysis based on the SIS model (Q5024414) (← links)
- Matrix functions in network analysis (Q6068264) (← links)
- Communicability cosine distance: similarity and symmetry in graphs/networks (Q6192347) (← links)
