Pages that link to "Item:Q551303"

The following pages link to Identities for minors of the Laplacian, resistance and distance matrices (Q551303):

Displaying 15 items.

• On the resistance matrix of a graph (Q259168) (← links)
• On a quadratic programming problem involving distances in trees (Q338937) (← links)
• Simple expressions for the long walk distance (Q389550) (← links)
• The walk distances in graphs (Q427888) (← links)
• The 2-Steiner distance matrix of a tree (Q2085417) (← links)
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree (Q2092377) (← links)
• Algorithmic techniques for finding resistance distances on structured graphs (Q2166256) (← links)
• Hitting time quasi-metric and its forest representation (Q2174870) (← links)
• On solving a non-convex quadratic programming problem involving resistance distances in graphs (Q2177791) (← links)
• The Arithmetic Tutte polynomial of two matrices associated to Trees (Q2326543) (← links)
• Color signless Laplacian energy of graphs (Q2409756) (← links)
• Some results on the Laplacian spectra of graphs with pockets (Q2413361) (← links)
• A recursion formula for resistance distances and its applications (Q2444563) (← links)
• Resistance matrices of balanced directed graphs (Q5065533) (← links)
• Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights (Q5210721) (← links)