Skip to main content
Have a personal or library account? Click to login
On ordering of minimal energies in bicyclic signed graphs Cover

On ordering of minimal energies in bicyclic signed graphs

Open Access
|Jul 2021

Abstract

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, we determine the bicyclic signed graphs with first 20 minimal energies for all n ≥ 30 and with first 16 minimal energies for all 17 ≤ n ≤ 29.

Language: English
Page range: 86 - 121
Submitted on: Mar 22, 2021
Accepted on: Apr 5, 2021
Published online: Jul 8, 2021
Published in print: Jun 1, 2021
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2021 S. Pirzada, Tahir Shamsher, Mushtaq A. Bhat, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution 4.0 License.