vix.ing · top · new · best · stats · spec

Signed Distance Laplacian Matrices for Signed Graphs

2020/10/08 by Roshni T Roy, K A Germina, Roy, Roshni T +5 · 1 citation
Computer Science · Materials Science · Mathematics · #05C12 (Primary) #05C22 #05C50 #05C75 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Magnetism in coordination complexes #Matrix Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.2010.04204

openalex publication_date 2020/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

Related