Pages that link to "Item:Q1247981"
From MaRDI portal
The following pages link to Distance matrix polynomials of trees (Q1247981):
Displayed 17 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- On Euclidean distance matrices (Q884414) (← 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 matrices and Laplacians (Q1779393) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- On a conjecture of Graham and Lovász about distance matrices (Q2276978) (← links)
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations (Q2465831) (← links)
- A \(q\)-analogue of the distance matrix of a tree (Q2496651) (← links)
- A simple proof of Graham and Pollak's theorem (Q2497973) (← links)
- Distance matrix and Laplacian of a tree with attached graphs (Q2575016) (← links)
- On Isometric Embeddings of Graphs (Q3697031) (← links)