Signed Complete Graphs with Maximum Index
Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges. It was conjectured that if is a signed complete graph of...
Shranjeno v:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
University of Zielona Góra
2020-05-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online dostop: | https://doi.org/10.7151/dmgt.2276 |
| Oznake: |
Brez oznak, prvi označite!
|