
handle: 11588/752419
Summary: A signed graph is a pair \(\Gamma=(G,\sigma)\), where \(G=(V(G),E(G))\) is a graph and \(\sigma:E(G)\rightarrow\{+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.
Signed graphs, Lexicographic product, spectral properties, Graph operations (line graphs, products, etc.), Signed graphs, Lexicographic product, Signed and weighted graphs, signed regularities
Signed graphs, Lexicographic product, spectral properties, Graph operations (line graphs, products, etc.), Signed graphs, Lexicographic product, Signed and weighted graphs, signed regularities
| 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). | 0 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
