Signed distance in signed graphs

From MaRDI portal




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.









This page was built for publication: Signed distance in signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226431)