Pages that link to "Item:Q4377496"

The following pages link to Distances in Weighted Trees and Group Inverse of Laplacian Matrices (Q4377496):

Displaying 36 items.

• Potentials of random walks on trees (Q273134) (← links)
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs (Q417455) (← links)
• Characterization of symmetric \(M\)-matrices as resistive inverses (Q999811) (← links)
• Inverse Perron values and connectivity of a uniform hypergraph (Q1627203) (← links)
• Geometry of complex networks and topological centrality (Q1673137) (← links)
• A generalized inverse for graphs with absorption (Q1675661) (← links)
• Forest matrices around the Laplacian matrix (Q1855402) (← links)
• On trees with perfect matchings (Q1863567) (← links)
• Linear estimation in models based on a graph (Q1970440) (← links)
• Resistance distances in extended or contracted networks (Q2002547) (← links)
• A tight upper bound on the spectral radius of bottleneck matrices for graphs (Q2002805) (← links)
• Moore-Penrose inverse of the incidence matrix of a distance regular graph (Q2002810) (← links)
• Performance and stability of direct methods for computing generalized inverses of the graph Laplacian (Q2208933) (← links)
• A combinatorial expression for the group inverse of symmetric \(M\)-matrices (Q2236392) (← links)
• Resistance characterizations of equiarboreal graphs (Q2404377) (← links)
• Acute perturbation of the group inverse (Q2406406) (← links)
• Representations for the group inverse of anti-triangular block operator matrices (Q2438481) (← links)
• The effect on the algebraic connectivity of a tree by grafting or collapsing of edges (Q2469512) (← links)
• The sharpness of a lower bound on the algebraic connectivity for maximal graphs (Q2720366) (← links)
• Some results on resistance distances and resistance matrices (Q2938357) (← links)
• Incremental Computation of Pseudo-Inverse of Laplacian (Q2942445) (← links)
• Maximizing the distance between center, centroid and characteristic set of a tree (Q3439834) (← links)
• On operations in which graphs are appended to trees (Q4464276) (← links)
• Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs (Q4643717) (← links)
• On a bound on algebraic connectivity: the case of equality (Q4700046) (← links)
• Extremal first passage times for trees (Q4762930) (← links)
• A minimax-condition for the characteristic center of a tree (Q4942584) (← links)
• Algebraic connectivity and the characteristic set of a graph (Q4942589) (← links)
• Minimal ∞-norm of generalized inverses of the incidence matrix of a tree (Q4992533) (← links)
• Semi-supervised learning with regularized Laplacian (Q5268919) (← links)
• (Q5708561) (← links)
• On graphs with equal algebraic and vertex connectivity (Q5957182) (← links)
• A note on Moore–Penrose inverse of Laplacian matrix of graphs (Q6174770) (← links)
• On distance Laplacian matrices of weighted trees (Q6656447) (← links)
• Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications (Q6665963) (← links)
• Predicting Feynman periods in \(\phi^4\)-theory (Q6671438) (← links)