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.
Recommendations
Cites work
Cited in
(21)- Eigenvalue multiplicity in cubic signed graphs
- Extremal spectral results related to spanning trees of signed complete graphs
- Characterizations of Some Parity Signed Graphs
- Gain distance matrices for complex unit gain graphs
- The dimension of valid distance drawings of signed graphs
- Open problems in the spectral theory of signed graphs
- Social balance - a signed detour distance analysis
- Eigenpairs of adjacency matrices of balanced signed graphs
- On the distance spectra of product of signed graphs
- Normalized distance Laplacian matrices for signed graphs
- Signed distance Laplacian matrices for signed graphs
- On weight-symmetric 3-coloured digraphs
- Signed graphs for portfolio analysis in risk management
- Detour distance Laplacian matrices for signed networks
- On balance and consistency of \(d\)-antipodal graph of derived signed Smith graphs
- Balance in random signed intersection graphs
- On the distance compatibility in product of signed graphs
- Signed distance \(k\)-domatic numbers of graphs
- Distance Signatures of Extended and Co-extended Incidence Graphs of Affine Designs
- Balanced subeulerian signed graphs and signed line graphs
- On the powers of signed graphs
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)