Ordering of minimal energies in unicyclic signed graphs

Tahir Shamsher, Mushtaq Bhat, Shariefuddin Pirzada*, Yilun Shang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
48 Downloads (Pure)

Abstract

Let S = (G, σ) be a signed graph of order n and size m and let t1, t2, . . . , tn be the eigenvalues of S. The energy of S is defined as E(S) = Pnj=1|tj|. A connected signed graph is said to be unicyclic if its order and size are same. In this paper, we characterize, up to switching, theunicyclic signed graphs with first 11 minimal energies for all n ≥ 12. For 3 ≤ n ≤ 7, we provide complete ordering of unicyclic signed graphs with respect to energy. For n = 8, 9, 10 and 11, we determine unicyclic signed graphs with first 13 minimal energies respectively.
Original languageEnglish
Pages (from-to)119–133
JournalRevista de la Union Matematica Argentina
Volume65
Issue number1
DOIs
Publication statusPublished - 16 May 2023

Fingerprint

Dive into the research topics of 'Ordering of minimal energies in unicyclic signed graphs'. Together they form a unique fingerprint.

Cite this