On ordering of minimal energies in bicyclic signed graphs-Reference-Cited by-同舟云学术

On ordering of minimal energies in bicyclic signed graphs

Published:2021-06-01 Issue:1 Volume:13 Page:86-121
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Pirzada S.¹,Shamsher Tahir¹,Bhat Mushtaq A.²

Affiliation:

1. Department of Mathematics , University of Kashmir , Srinagar , India

2. Department of Mathematics , National Institute of Technology , Srinagar , India

Abstract

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 = 1 n | x j |

\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.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2021-0005

Reference17 articles.

1. [1] B. D. Acharya, Spectral criterion for the cycle balance in networks, J. Graph Theory 4 (1980) 1–11. ⇒88

2. [2] M. A. Bhat, S. Pirzada, Unicyclic signed graphs with minimal energy, Discrete Appl. Math. 226 (2017) 32–39. ⇒87, 88, 90

3. [3] M. A. Bhat, S. Pirzada, On equienergetic signed graphs, Discrete Appl. Math. 189 (2015) 1–7. ⇒87, 103

4. [4] M. A. Bhat, U. Samee, S. Pirzada, Bicyclic signed graphs with minimal and second minimal energy, Linear Algebra Appl. 551 (2018) 18–35. ⇒87, 89, 90, 91, 99

5. [5] X. Yang L. Wang, On the ordering of bicyclic digraphs with respect to energy and iota energy, Applied Math. Comput. 339 (2018) 768–778. ⇒87