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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/8747684 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832560056103600128 |
|---|---|
| author | Yajing Wang Yubin Gao |
| author_facet | Yajing Wang Yubin Gao |
| author_sort | Yajing Wang |
| collection | DOAJ |
| description | 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 paper, we characterize tricyclic signed graphs with minimal energy. |
| format | Article |
| id | doaj-art-ac776e6d23ce4af5b22dcd981064cd76 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-ac776e6d23ce4af5b22dcd981064cd762025-02-03T01:28:33ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/87476848747684Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2)Yajing Wang0Yubin Gao1Department of Data Science and Technology, North University of China, Taiyuan, Shanxi 030051, ChinaDepartment of Mathematics, North University of China, Taiyuan, Shanxi 030051, ChinaA 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 paper, we characterize tricyclic signed graphs with minimal energy.http://dx.doi.org/10.1155/2020/8747684 |
| spellingShingle | Yajing Wang Yubin Gao Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) Complexity |
| title | Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) |
| title_full | Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) |
| title_fullStr | Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) |
| title_full_unstemmed | Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) |
| title_short | Research on Extreme Signed Graphs with Minimal Energy in Tricyclic Signed Graphs S(n, n + 2) |
| title_sort | research on extreme signed graphs with minimal energy in tricyclic signed graphs s n n 2 |
| url | http://dx.doi.org/10.1155/2020/8747684 |
| work_keys_str_mv | AT yajingwang researchonextremesignedgraphswithminimalenergyintricyclicsignedgraphssnn2 AT yubingao researchonextremesignedgraphswithminimalenergyintricyclicsignedgraphssnn2 |