On ordering of minimal energies in bicyclic signed graphs
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2021-06-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausi-2021-0005 |
| id |
doaj-70e1d169e1944204ab624a1f0937e3e1 |
|---|---|
| record_format |
Article |
| spelling |
doaj-70e1d169e1944204ab624a1f0937e3e12021-09-06T19:41:26ZengSciendoActa Universitatis Sapientiae: Informatica2066-77602021-06-011318612110.2478/ausi-2021-0005On ordering of minimal energies in bicyclic signed graphsPirzada S.0Shamsher Tahir1Bhat Mushtaq A.2Department of Mathematics, University of Kashmir, Srinagar, IndiaDepartment of Mathematics, University of Kashmir, Srinagar, IndiaDepartment of Mathematics, National Institute of Technology, Srinagar, IndiaLet 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.https://doi.org/10.2478/ausi-2021-0005bicyclic signed graphbalancespectrumsigned energyordering05c2205c5005c76 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Pirzada S. Shamsher Tahir Bhat Mushtaq A. |
| spellingShingle |
Pirzada S. Shamsher Tahir Bhat Mushtaq A. On ordering of minimal energies in bicyclic signed graphs Acta Universitatis Sapientiae: Informatica bicyclic signed graph balance spectrum signed energy ordering 05c22 05c50 05c76 |
| author_facet |
Pirzada S. Shamsher Tahir Bhat Mushtaq A. |
| author_sort |
Pirzada S. |
| title |
On ordering of minimal energies in bicyclic signed graphs |
| title_short |
On ordering of minimal energies in bicyclic signed graphs |
| title_full |
On ordering of minimal energies in bicyclic signed graphs |
| title_fullStr |
On ordering of minimal energies in bicyclic signed graphs |
| title_full_unstemmed |
On ordering of minimal energies in bicyclic signed graphs |
| title_sort |
on ordering of minimal energies in bicyclic signed graphs |
| publisher |
Sciendo |
| series |
Acta Universitatis Sapientiae: Informatica |
| issn |
2066-7760 |
| publishDate |
2021-06-01 |
| description |
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. |
| topic |
bicyclic signed graph balance spectrum signed energy ordering 05c22 05c50 05c76 |
| url |
https://doi.org/10.2478/ausi-2021-0005 |
| work_keys_str_mv |
AT pirzadas onorderingofminimalenergiesinbicyclicsignedgraphs AT shamshertahir onorderingofminimalenergiesinbicyclicsignedgraphs AT bhatmushtaqa onorderingofminimalenergiesinbicyclicsignedgraphs |
| _version_ |
1717766223223062528 |