CFP last date
20 November 2025
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2025

Submit your paper
Know more
The week's pick
Responsive image
A Hybrid Transformer-CNN Framework with Early and Late Fusion for Robust Skin Lesion Classification

Raihan Tanvir
Random Articles
Reseach Article

An Algorithm for Testing a Signed Graph for Balance

by Ioannis S. Xezonakis, Danai Xezonaki
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 184 - Number 11
Year of Publication: 2022
Authors: Ioannis S. Xezonakis, Danai Xezonaki
10.5120/ijca2022922089

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 },
issue_date = { May 2022 },
volume = { 184 },
number = { 11 },
month = { May },
year = { 2022 },
issn = { 0975-8887 },
pages = { 41-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume184/number11/32371-2022922089/ },
doi = { 10.5120/ijca2022922089 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:21:13.314848+05:30
%A Ioannis S. Xezonakis
%A Danai Xezonaki
%T An Algorithm for Testing a Signed Graph for Balance
%J International Journal of Computer Applications
%@ 0975-8887
%V 184
%N 11
%P 41-44
%D 2022
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. F. Harary, and J. A. Kabell, 1980. A simple algorithm to detect balance in signed graphs. Mathematical Social Scienses 1, 131-136.
  2. F. Harary, 1953-1954. On the Notion of Balance of a Signed Graph. Michigan Mathematical Journal 2, 143-146.
  3. F. Harary, R.Z. Norman, and D. Cartwright, 1965. Structural Models: An Introduction to the Theory of Directed Graphs. Wiley.
  4. T. Zaslavsky, 1981. Characterization of Signed Graphs. Journal of Graph Theory, 5, 401-406.
  5. C. Hoede, 1992. A Characterization of Consistent Marked Graphs. Journal of Graph Theory, 16(1), 17-23.
  6. F. Heider, 1946. Attitudes and Cognitive Organization. The Journal of Psychology, 21, 107-112.
  7. B. Vasanthi et al., 2015. Applications of Signed Graphs to Portfolio Turnover Analysis. Procedia – Social and Behavioral Sciences, 211, 1203-1209.
  8. E. Loukakis, 2003. A Dynamic Programming Algorithm to Test a Signed Graph for Balance. Intern. J. Computer Math., 80(4), 499-507.
  9. S. Hameed et al., 2020. Signed Distance in Signed Graphs. Linear Algebra and its Applications, 608, 236-247.
  10. T. V. Shijin et al., 2022. On the powers of signed graphs. Communications in Combinatorics and Optimization. 7 (1), 45-51.
Index Terms

Computer Science
Information Sciences

Keywords

Balanced graphs Signed graphs

Powered by PhDFocusTM