On ordering of minimal energies in bicyclic signed graphs
Let S = (G, σ) be a signed graph of order n and size m and let x1, x2, ..., xn be the eigenvalues of S. The energy of S is defined as ɛ(S)=∑j=1n|xj|\varepsilon \left( S \right) = \sum\limits_{j = 1}^n {\left| {{x_j}} \right|}. A connected signed graph is said to be bicyclic if m=n + 1. In this paper...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2021-06-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausi-2021-0005 |