The following pages link to (Q5708561):
Displaying 19 items.
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- The communicability distance in graphs (Q414715) (← links)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311) (← links)
- Semi-supervised classification and betweenness computation on large, sparse, directed graphs (Q632618) (← links)
- Centrality measure in graphs (Q977050) (← links)
- Resistance distance in wheels and fans (Q981848) (← links)
- A generalized inverse for graphs with absorption (Q1675661) (← links)
- Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) (← links)
- Forest matrices around the Laplacian matrix (Q1855402) (← links)
- Resistance distances in extended or contracted networks (Q2002547) (← links)
- Polynomial graph invariants and the KP hierarchy (Q2190734) (← links)
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic (Q2201378) (← links)
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices (Q2236392) (← links)
- Discrete elliptic operators and their Green operators (Q2437353) (← links)
- Spanning forests and the golden ratio (Q2476266) (← links)
- Vertex degrees and doubly stochastic graph matrices (Q3081308) (← links)
- Resistance distances on networks (Q5034280) (← links)
- (Q5150374) (← links)
- On the structure of Laplacian characteristic polynomial of circulant graphs (Q6545162) (← links)
