scientific article; zbMATH DE number 2230269
From MaRDI portal
Publication:5708561
Cites work
- Aggregation of preferences by the generalized row sum method
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Doubly stochastic graph matrices, II
- Graph-theoretic interpretation of the generalized row sum method
- scientific article; zbMATH DE number 1482918 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 1890092 (Why is no real title available?)
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
- Linear estimation in models based on a graph
- On a duality between metrics and \(\Sigma\)-proximities
- On proximity measures for graph vertices
- Rank one perturbation and its application to the laplacian spectrum of a graph∗
- The matrix-forest theorem and measuring relations in small social groups
Cited in
(20)- A generalized inverse for graphs with absorption
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Forest matrices around the Laplacian matrix
- Resistance distances in extended or contracted networks
- Polynomial graph invariants and the KP hierarchy
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- Discrete elliptic operators and their Green operators
- Spanning forests and the golden ratio
- Vertex degrees and doubly stochastic graph matrices
- Hyperspherical embedding of graphs and networks in communicability spaces
- The communicability distance in graphs
- Resistance distances on networks
- On special properties of some quasi-metrics
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Semi-supervised classification and betweenness computation on large, sparse, directed graphs
- On the structure of Laplacian characteristic polynomial of circulant graphs
- The shortest-path distance on graphons
- Centrality measure in graphs
- Resistance distance in wheels and fans
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5708561)
