Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S ( n, n + 2)

Yajing Wang and Yubin Gao

Complexity, 2020, vol. 2020, 1-8

Abstract:

A signed graph is acquired by attaching a sign to each edge of a simple graph, and the signed graphs have been widely used as significant computer models in the study of complex systems. The energy of a signed graph can be described as the sum of the absolute values of its eigenvalues. In this paper, we characterize tricyclic signed graphs with minimal energy.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/8747684.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/8747684.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8747684

DOI: 10.1155/2020/8747684

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().