Distance matrix of weighted cactoid-type digraphs

DOI10.1080/03081087.2021.1916423MaRDI QIDQ5870097zbMATH OpenOpenAlexFDO

Authors Joyentanuj Das, Sumit Mohanty

Publication date 5 January 2023

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

inversedeterminantdistance matrixcyclesweighted digraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Signed and weighted graphs (05C22) Connectivity (05C40)

Abstract: A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance matrix for weighted cactoid-type digraphs and find its inverse, whenever it exists. We also compute the determinant of the distance matrix for a class of unweighted and undirected graphs consisting of finitely many cycles, sharing a common path.

Recommendations

• Inverse of the distance matrix of a weighted cactoid digraph
• Inverse of the distance matrix of a cactoid digraph
• On the distance spectral radius of cacti
• On the determinant of \(q\)-distance matrix of a graph
• scientific article; zbMATH DE number 7692338

Cites work

• Computing the determinant of the distance matrix of a bicyclic graph
• Distance matrix of a class of completely positive graphs: determinant and inverse
• Distance matrix of a multi-block graph: determinant and inverse
• Distance matrix polynomials of trees
• Graphs and matrices
• Inverse of the distance matrix of a bi-block graph
• Inverse of the distance matrix of a block graph
• Inverse of the distance matrix of a cactoid digraph
• Inverse of the distance matrix of a cycle-clique graph
• Inverse of the distance matrix of a weighted cactoid digraph
• Normalized graph Laplacians for directed graphs
• On distance matrices and Laplacians
• On mixed block graphs
• On the Addressing Problem for Loop Switching
• On the distance matrix of a directed graph
• The Schur complement and its applications
• The determinant of the distance matrix of graphs with blocks at most bicyclic
• The distance matrix of a bidirected tree
• The inverse of the distance matrix of a distance well-defined graph

Cited in

(3)

• Inverse of the distance matrix of a weighted cactoid digraph
• Inverse of the distance matrix of a cactoid digraph
• scientific article; zbMATH DE number 6857397 (Why is no real title available?)

This page was built for publication: Distance matrix of weighted cactoid-type digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870097)