Gain distance matrices for complex unit gain graphs

DOI10.1016/j.disc.2021.112634zbMath1476.05127arXiv2101.11558OpenAlexW3204332640MaRDI QIDQ2237218

Aniruddha Samanta, M. Rajesh Kannan

Publication date: 27 October 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

adjacency matrixdistance matrixcomplex unit gain graphsigned distance matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Matrices of integers (15B36) Signed and weighted graphs (05C22)

Related Items (5)

On weight-symmetric 3-coloured digraphs ⋮ On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph ⋮ Characterizing signed mixed graphs with small eigenvalues ⋮ NEPS of complex unit gain graphs ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral properties of complex unit gain graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Biased graphs. I: Bias, balance, and gains
• Signed graphs
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• On distance matrices and Laplacians
• Signed distance in signed graphs
• Bounds for the energy of a complex unit gain graph
• Distance spectra of graphs: a survey
• Large regular bipartite graphs with median eigenvalue 1
• On the notion of balance of a signed graph
• Vertices of Localized Imbalance in a Biased Graph
• Spectral criterion for cycle balance in networks
• On the distance matrix of a directed graph
• Integral regular net-balanced signed graphs with vertex degree at most four
• On the Addressing Problem for Loop Switching

This page was built for publication: Gain distance matrices for complex unit gain graphs