Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
The adjacency matrix of a signed graph has +1 or -1 for adjacent vertices, depending on the sign of the connecting edge. According to this concept, an ordinary graph can be interpreted as a signed graph without negative edges. An edge-decomposition of a signed graph G is a partition of its edge set...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Elsevier
2023-07-01
|
| Serier: | Kuwait Journal of Science |
| Fag: | |
| Online adgang: | https://www.sciencedirect.com/science/article/pii/S2307410823000421 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|