Pages that link to "Item:Q1247981"

The following pages link to Distance matrix polynomials of trees (Q1247981):

Displaying 50 items.

• On the resistance matrix of a graph (Q259168) (← links)
• Ordering trees by their distance spectral radii (Q260039) (← links)
• The product distance matrix of a tree with matrix weights on its arcs (Q269531) (← links)
• The distance matrix of a tree with weights on its arcs (Q331180) (← links)
• Two Laplacians for the distance matrix of a graph (Q389586) (← links)
• The inertia of distance matrices of some graphs (Q389985) (← links)
• A short note on a short remark of Graham and Lovász (Q393167) (← links)
• Some graft transformations and its applications on the distance spectral radius of a graph (Q427598) (← links)
• The inverse of the distance matrix of a distance well-defined graph (Q503411) (← links)
• On the two largest distance eigenvalues of graph powers (Q503610) (← links)
• The distance spectra of Cayley graphs of Coxeter groups (Q533786) (← links)
• Identities for minors of the Laplacian, resistance and distance matrices (Q551303) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix (Q726657) (← links)
• Inverses of \(q\)-distance matrices of a tree (Q732087) (← links)
• Distance spectral radius of uniform hypergraphs (Q739129) (← links)
• Inverse of the distance matrix of a cycle-clique graph (Q745178) (← links)
• Another simple proof of Graham and Pollak's theorem (Q785789) (← links)
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
• Distance matrix of a class of completely positive graphs: determinant and inverse (Q828089) (← links)
• \(q\)-analogs of distance matrices of 3-hypertrees (Q837003) (← links)
• A constructive algorithm for realizing a distance matrix (Q858334) (← links)
• On Euclidean distance matrices (Q884414) (← links)
• On a symmetric representation of Hermitian matrices and its applications to graph theory (Q896012) (← links)
• The distance signatures of the incidence graphs of affine resolvable designs (Q905703) (← links)
• Distance spectra and distance energy of integral circulant graphs (Q984867) (← links)
• Cluj polynomials (Q1029743) (← links)
• Omega polynomial in twisted/chiral polyhex tori (Q1029744) (← links)
• On some counting polynomials in chemistry (Q1095908) (← links)
• A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
• On the geometry and Laplacian of a graph (Q1174690) (← links)
• Factoring distance matrix polynomials (Q1313852) (← links)
• Laplacian matrices of graphs: A survey (Q1319985) (← links)
• On distance spectral radius of uniform hypergraphs with cycles (Q1706123) (← links)
• On least distance eigenvalue of uniform hypergraphs (Q1722033) (← links)
• On distance matrices and Laplacians (Q1779393) (← links)
• Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
• On distance spectral radius of graphs (Q1947109) (← links)
• On the distance and distance signless Laplacian spectral radii of tricyclic graphs (Q1988570) (← links)
• Distance matrices of subsets of the Hamming cube (Q2020430) (← links)
• On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices (Q2020702) (← links)
• Multicovering hypergraphs (Q2022167) (← links)
• The distance matrix of caterpillar (Q2026332) (← links)
• On the distance \(\alpha \)-spectral radius of a connected graph (Q2069474) (← links)
• Effective resistance is more than distance: Laplacians, simplices and the Schur complement (Q2074965) (← 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)
• Steiner distance matrix of caterpillar graphs (Q2125582) (← links)
• Computing the determinant of the distance matrix of a bicyclic graph (Q2132376) (← links)
• On the rank of the distance matrix of graphs (Q2161884) (← links)