Signed graphs connected with the root lattice
For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that each edge between the sets is negative and each...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Department of Physics, Mahendra Morang Adarsh Multiple Campus, Tribhuvan University
2014-05-01
|
| Series: | Bibechana |
| Subjects: | |
| Online Access: | https://www.nepjol.info/index.php/BIBECHANA/article/view/10396 |