Name
Abstract | ||
|---|---|---|
A signed graph is a pair Gamma = (G, sigma), where G = (V (G),E (G)) is a graph and sigma : E (G) -> {+1, -1} is the sign function on the edges of G. The notion of composition (also known as lexicographic product) of two signed graphs Gamma and Lambda = (H, tau) already exists in literature, yet it fails to map balanced graphs onto balanced graphs. We improve the existing definition showing that our 'new' signature on the lexicographic product of G and H behaves well with respect to switching equivalence. Signed regularities and some spectral properties are also discussed. |
Year | Venue | DocType |
|---|---|---|
2019 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
74 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maurizio Brunetti | 1 | 0 | 1.01 |
| Matteo Cavaleri | 2 | 0 | 2.03 |
| Alfredo Donno | 3 | 27 | 8.03 |