Signed Distance Laplacian Matrices for Signed Graphs
Combinatorics
2020-10-12 v1
Abstract
A signed graph is a graph whose edges are labeled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance laplacian matrices. We characterize balance in signed graphs using these matrices and find signed distance laplacian spectra of some classes of unbalanced signed graphs.
Cite
@article{arxiv.2010.04204,
title = {Signed Distance Laplacian Matrices for Signed Graphs},
author = {Roshni T Roy and K A Germina and K Shahul Hameed and Thomas Zaslavsky},
journal= {arXiv preprint arXiv:2010.04204},
year = {2020}
}
Comments
12 pp