Some relations between the largest eigenvalue and the frustration index of a signed graph
Let \(\dot{G}\) be a signed graph with \(n\) vertices and the frustration index \(\ell\). We prove the existence of \(k~(k\geq \ell)\) edges \(e_1, e_2, \ldots, e_k\) of \(\dot{G}\) such that \[\begin{equation*}\lambda_1(\dot{G})\leq \lambda_1(\dot{G}-e_1)\leq \lambda_1(\dot{G}-e_1-e_2)\leq\cdots\l...
Gorde:
| Egile nagusia: | |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
American Journal of Combinatorics
2022-12-01
|
| Saila: | The American Journal of Combinatorics |
| Gaiak: | |
| Sarrera elektronikoa: | https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/7 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|