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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-07-01
|
| Series: | Kuwait Journal of Science |
| Subjects: | |
| Online Access: | https://www.sciencedirect.com/science/article/pii/S2307410823000421 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|