International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 184 - Issue 11 |
Published: May 2022 |
Authors: Ioannis S. Xezonakis, Danai Xezonaki |
![]() |
Ioannis S. Xezonakis, Danai Xezonaki . An Algorithm for Testing a Signed Graph for Balance. International Journal of Computer Applications. 184, 11 (May 2022), 41-44. DOI=10.5120/ijca2022922089
@article{ 10.5120/ijca2022922089, author = { Ioannis S. Xezonakis,Danai Xezonaki }, title = { An Algorithm for Testing a Signed Graph for Balance }, journal = { International Journal of Computer Applications }, year = { 2022 }, volume = { 184 }, number = { 11 }, pages = { 41-44 }, doi = { 10.5120/ijca2022922089 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2022 %A Ioannis S. Xezonakis %A Danai Xezonaki %T An Algorithm for Testing a Signed Graph for Balance%T %J International Journal of Computer Applications %V 184 %N 11 %P 41-44 %R 10.5120/ijca2022922089 %I Foundation of Computer Science (FCS), NY, USA
A signed graph consists of a graph together with a sign characterizing each vertex. A fundamental concept of signed graphs is that of balance. In this paper a programming algorithm is presented in order to detect balance in signed graphs. The algorithm traverses each vertex at most once and uses two stacks for the implementation, each having a size of at most the number of vertices of the graph. Moreover, the graph need not be stored in computer's memory.