
arXiv: 2005.06202
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.
v1: 11 pp. v2: 16 pp with more eigenvalue results and 2 figures
Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), signed distance compatibility, Signed and weighted graphs, signed distance matrix, signed graph, signed distance spectrum, Primary 05C12, Secondary 05C22, 05C50, 05C75, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO)
Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), signed distance compatibility, Signed and weighted graphs, signed distance matrix, signed graph, signed distance spectrum, Primary 05C12, Secondary 05C22, 05C50, 05C75, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
