2000 character limit reached
Signed Distance Laplacian Matrices for Signed Graphs (2010.04204v1)
Published 8 Oct 2020 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.