Computing the determinant of the distance matrix of a bicyclic graph

DOI10.1016/j.entcs.2019.08.037OpenAlexW2977931216WikidataQ113317395 ScholiaQ113317395MaRDI QIDQ2132376

Luciano N. Grippo, Ezequiel Dratman, Martín D. Safe, Renata R. Del-Vecchio, Celso M. jun. da Silva

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.037

zbMATH Keywords

determinantdistance matrixbicyclic graphs

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (2)

The determinant of the distance matrix of graphs with blocks at most bicyclic ⋮ Distance matrix of weighted cactoid-type digraphs

Cites Work

• Distance matrix polynomials of trees
• On distance matrices and Laplacians
• Inverse of the distance matrix of a block graph
• On the distance matrix of a directed graph
• On the Addressing Problem for Loop Switching

This page was built for publication: Computing the determinant of the distance matrix of a bicyclic graph