Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Algorithms for derivation of structurally stable Hamiltonian signed graphs |
| Author (s): | Harary, Frank Lim, Meng-Hiot Agarwal, Amit Wunsch, Donald C. |
| Department/Lab Affiliations: | Applied Computational Intelligence Laboratory Electrical and Computer Engineering |
| Keywords: | Algorithm Computational risk management Signed graphs Structural balance |
| Issue Date: | 2004 |
| Publisher: | Taylor & Francis Group |
| Citation: | Harary, Frank, Lim, Meng-Hiot, Agarwal, Amit, and Wunsch, Donald C. “Algorithms for Derivation of Structurally Stable Hamiltonian Signed Graphs,” , International Journal of Computer Mathematics, Vol. 81, No. 11, November 2004, pp. 1349-1356. |
| Abstract: | A graph Sp,q,n refers to a signed graph with p nodes and q edges with n being the number of negative edges. We introduce two theorems to facilitate identification of the complete set of balanced signed graph configurations for any p-node Hamiltonian signed graph in terms of p, q and n. This allows for the development of computational procedures to efficiently determine the structural stability of a signed graph. This is potentially useful for the planning and analysis of complex situations or scenarios which can be depicted as signed graphs. Through the application of the theorems, the state of balance of a signed graph structure or its affinity towards balance can be determined in a more time-efficient manner compared to any explicit enumeration algorithm. |
| Type: | Article - Journal text |
| In Title: | International Journal of Computer Mathematics |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | Algorithms for derivation of structurally stable Hamiltonian signed graphs |
| contributor.author | Harary, Frank |
| contributor.author | Lim, Meng-Hiot |
| contributor.author | Agarwal, Amit |
| contributor.author | Wunsch, Donald C. |
| contributor.deptlab | Applied Computational Intelligence Laboratory |
| contributor.deptlab | Electrical and Computer Engineering |
| subject | Algorithm |
| subject | Computational risk management |
| subject | Signed graphs |
| subject | Structural balance |
| date.issued | 2004 |
| publisher | Taylor & Francis Group |
| identifier.citation | Harary, Frank, Lim, Meng-Hiot, Agarwal, Amit, and Wunsch, Donald C. “Algorithms for Derivation of Structurally Stable Hamiltonian Signed Graphs,” , International Journal of Computer Mathematics, Vol. 81, No. 11, November 2004, pp. 1349-1356. |
| identifier.pub.URI | |
| description.abstract | A graph Sp,q,n refers to a signed graph with p nodes and q edges with n being the number of negative edges. We introduce two theorems to facilitate identification of the complete set of balanced signed graph configurations for any p-node Hamiltonian signed graph in terms of p, q and n. This allows for the development of computational procedures to efficiently determine the structural stability of a signed graph. This is potentially useful for the planning and analysis of complex situations or scenarios which can be depicted as signed graphs. Through the application of the theorems, the state of balance of a signed graph structure or its affinity towards balance can be determined in a more time-efficient manner compared to any explicit enumeration algorithm. |
| type | Article - Journal |
| type.DCMIType | text |
| type.status | Final version |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights.URI | |
| relation.isPartOf | International Journal of Computer Mathematics |
| date.accessioned | 2007-04-11T17:00:48Z |
| date.available | 2008-03-24T20:17:57Z |
| identifier.persist.URI |