On the rank of the distance matrix of graphs

DOI10.1016/j.amc.2022.127394OpenAlexW4284992102WikidataQ114210811 ScholiaQ114210811MaRDI QIDQ2161884

Adrián Pastine, Ezequiel Dratman, Luciano N. Grippo, Veronica A. Moyano

Publication date: 5 August 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02455

zbMATH Keywords

threshold graphdistance matrixtrivially perfect graphdistance rank

Mathematics Subject Classification ID

Graph theory (05Cxx) Basic linear algebra (15Axx) Combinatorics (05-XX)

Cites Work

• A characterization of graphs with rank 5
• A characterization of graphs with rank 4
• Complement reducible graphs
• Ramsey's theorem - a new lower bound
• Distance matrix polynomials of trees
• Trivially perfect graphs
• Laplacian matrices of graphs: A survey
• On distance matrices and Laplacians
• Algorithmic graph theory and perfect graphs
• Quasi-threshold graphs
• The determinant of the distance matrix of graphs with blocks at most bicyclic
• On the nullity of graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: On the rank of the distance matrix of graphs