Temporary Suspension of Submission and Review System Due to technical issues, our submission and review system is temporarily out of service. Until the system is back, we will not be accepting new submissions. For any other urgent inquiries, please contact revuma@criba.edu.ar. We apologize for the inconvenience and appreciate your understanding. |
|||
Current volumePast volumes
1952-1968
1944-1951
1936-1944 |
Ordering of minimal energies in unicyclic signed graphs
Volume 65, no. 1
(2023),
pp. 119–133
https://doi.org/10.33044/revuma.2565
Abstract
Let $S=(G,\sigma)$ be a signed graph of order $n$ and size $m$ and let
$t_1,t_2,\dots,t_n$ be the eigenvalues of $S$. The energy of $S$ is
defined as $E(S)=\sum_{j=1}^{n}|t_j|$. A connected signed graph is said to
be unicyclic if its order and size are the same. In this paper we
characterize, up to switching, the unicyclic signed graphs with first $11$
minimal energies for all $n \geq 11$. For $3\leq n \leq 7$, we provide
complete orderings of unicyclic signed graphs with respect to energy. For $8
\leq n \leq 10$, we determine unicyclic signed graphs with first $13$
minimal energies.
References
|
||
|
Published by the Unión Matemática Argentina |
|||