Signed Distance in Signed Graphs
Combinatorics
2021-06-21 v2
Abstract
Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs. We also introduce the notion of distance-compatible signed graphs and partially characterize it.
Cite
@article{arxiv.2005.06202,
title = {Signed Distance in Signed Graphs},
author = {Shahul Hameed K and Shijin T and Soorya P and Germina K A and Thomas Zaslavsky},
journal= {arXiv preprint arXiv:2005.06202},
year = {2021}
}
Comments
v1: 11 pp. v2: 16 pp with more eigenvalue results and 2 figures