Revista de la
Unión Matemática Argentina
Ordering of minimal energies in unicyclic signed graphs
Tahir Shamsher, Mushtaq A. Bhat, Shariefuddin Pirzada, and Yilun Shang
Volume 65, no. 1 (2023), pp. 119–133    

https://doi.org/10.33044/revuma.2565

Download PDF

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

  1. M. A. Bhat and S. Pirzada, Unicyclic signed graphs with minimal energy, Discrete Appl. Math. 226 (2017), 32–39. MR 3659378.
  2. K. A. Germina, S. Hameed K, and T. Zaslavsky, On products and line graphs of signed graphs, their eigenvalues and energy, Linear Algebra Appl. 435 (2011), no. 10, 2432–2450. MR 2811128.
  3. I. Gutman and J. Y. Shao, The energy change of weighted graphs, Linear Algebra Appl. 435 (2011), no. 10, 2425–2431. MR 2811127.
  4. Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001), no. 3, 163–168. MR 1854967.
  5. J. Rada, Energy ordering of catacondensed hexagonal systems, Discrete Appl. Math. 145 (2005), no. 3, 437–443. MR 2112535.
  6. H. Y. Shan, J. Y. Shao, F. Gong, and Y. Liu, An edge grafting theorem on the energy of unicyclic and bipartite graphs, Linear Algebra Appl. 433 (2010), no. 3, 547–556. MR 2653819.
  7. Y. Shang, On the structural balance dynamics under perceived sentiment, Bull. Iranian Math. Soc. 46 (2020), no. 3, 717–724. MR 4096308.
  8. J. M. Zhu, Two new edge grafting operations on the energy of unicyclic graphs and their applications, Discrete Math. 312 (2012), no. 21, 3117–3127. MR 2957932.