An algorithmic characterization and spectral analysis of canonical splitting signed graph ξ(Σ)
An ordered pair Σ=(Σu,σ) is called the signed graph, where Σu=(V,E) is an underlying graph and σ is a signed mapping, called signature, from E to the sign set {+,−}. A marking of Σ is a function μ:V(Σ)→{+,−}. The canonical marking of a signed graph Σ, denoted μσ, is given asμσ(v)=Πvu∈E(Σ)σ(vu).The c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-06-01
|
| Series: | MethodsX |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2215016123005137 |