A signed graph is a pair = (G; ), where G = (V (G);E(G)) is a graph and 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 and = (H; ) already exists in literature, yet it fails to map balanced graphs onto balanced graphs. We improve the existing denition 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.
A Lexicographic product for Signed Graphs / Brunetti, M; Cavaleri, M; Donno, A.. - In: THE AUSTRALASIAN JOURNAL OF COMBINATORICS. - ISSN 2202-3518. - 74:2(2019), pp. 332-343.
A Lexicographic product for Signed Graphs
Brunetti M
;
2019
Abstract
A signed graph is a pair = (G; ), where G = (V (G);E(G)) is a graph and 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 and = (H; ) already exists in literature, yet it fails to map balanced graphs onto balanced graphs. We improve the existing denition 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.| File | Dimensione | Formato | |
|---|---|---|---|
|
ajc_v74_p332-343.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Documento in Post-print
Licenza:
Dominio pubblico
Dimensione
280.6 kB
Formato
Adobe PDF
|
280.6 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
