Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)
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 S can be described as the sum of the absolute values of its eigenvalues. In this pap...
Main Authors: | Yajing Wang, Yubin Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2020-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2020/8747684 |
Similar Items
-
On ordering of minimal energies in bicyclic signed graphs
by: Pirzada S., et al.
Published: (2021-06-01) -
The common minimal dominating signed graph
by: P. Siva Reddy, et al.
Published: (2012-09-01) -
The common minimal common neighborhood dominating signed graphs
by: Kavita S Permi, et al.
Published: (2013-03-01) -
On net-Laplacian energy of signed graphs
by: Nutan G. Nayak
Published: (2017-01-01) -
Directionally n-signed graphs-III: The notion of symmetric balance
by: P.Siva Kota Reddy, et al.
Published: (2013-12-01)