Abstract
ABSTRACT A signed graph is a graph whose edges are labelled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance Laplacian matrices. We characterize singularity and calculate the rank of these matrices and find signed distance Laplacian spectra of some classes of unbalanced signed graphs. We derive most of these results by proving them more generally for weighted signed graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
