Ordering of minimal energies in unicyclic signed graphs
DOI:
https://doi.org/10.33044/revuma.2565Abstract
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.
Downloads
References
M. A. Bhat and S. Pirzada, Unicyclic signed graphs with minimal energy, Discrete Appl. Math. 226 (2017), 32–39. MR 3659378.
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.
I. Gutman and J. Y. Shao, The energy change of weighted graphs, Linear Algebra Appl. 435 (2011), no. 10, 2425–2431. MR 2811127.
Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001), no. 3, 163–168. MR 1854967.
J. Rada, Energy ordering of catacondensed hexagonal systems, Discrete Appl. Math. 145 (2005), no. 3, 437–443. MR 2112535.
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.
Y. Shang, On the structural balance dynamics under perceived sentiment, Bull. Iranian Math. Soc. 46 (2020), no. 3, 717–724. MR 4096308.
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.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 Tahir Shamsher, Mushtaq Bhat, Shariefuddin Pirzada, Yilun Shang
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. The Journal may retract the paper after publication if clear evidence is found that the findings are unreliable as a result of misconduct or honest error.