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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Signed Graph and its Balance Theory in Transportation Problem

by Arun Kumar Baruah, Manoshi Kotoky
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 115 - Number 12
Year of Publication: 2015
Authors: Arun Kumar Baruah, Manoshi Kotoky
10.5120/20202-2455

Arun Kumar Baruah, Manoshi Kotoky . Signed Graph and its Balance Theory in Transportation Problem. International Journal of Computer Applications. 115, 12 ( April 2015), 9-12. DOI=10.5120/20202-2455

@article{ 10.5120/20202-2455,
author = { Arun Kumar Baruah, Manoshi Kotoky },
title = { Signed Graph and its Balance Theory in Transportation Problem },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 115 },
number = { 12 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 9-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume115/number12/20202-2455/ },
doi = { 10.5120/20202-2455 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:54:38.120882+05:30
%A Arun Kumar Baruah
%A Manoshi Kotoky
%T Signed Graph and its Balance Theory in Transportation Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 115
%N 12
%P 9-12
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Signed graph can be used as a graph theoretic tool to study transportation problem. A transportation problem can be efficiently modeled as a graph where the nodes represent the destinations and the edges represent the relationship among them. With the help of signed graph the relationship between various destinations in a transportation network can be represented. The simplest approach to study such a group of destinations is to draw a graph in which the destinations are the nodes (or vertices) and there is an edge joining each pair of destinations who are related in some way. It can also be checked whether the graph is stable or unstable with the use of signed graph and balance theory.

References
  1. Hitchcock, F. L. , The distribution of a product from several sources to numerous localities,Journal of Mathematical Physics, vol 20, (2006), pp. 224-230.
  2. Koopmans T. C. , Optimum Utiliztion of Transportation System, Econometrica, Supplement vol 17, (1949).
  3. Dantzig, G. B. , Linear Programming and Extensions, Princeton University Press, Princeton, N J, (1963).
  4. Harary, F, "On the notion of balance of a signed graph'', Michigan Math. J. 2, (1954), 143-146.
  5. Cartwright, D. , and Harary, F. , "Structural balance: a generalisation of Heider's theory''. (1956), Psychological Rev. 63, 277–293.
  6. Beineke, W. , Harary, F. , and Lowell, "Consistent graphs with signed points. '' Riv. Mat. Sci. Econom. Social, (1978), 81-88.
  7. Acharya,B. D. and B. Devadas, B. , " A characterization of consistent marked graphs'' Nat. Acad. Sci. Letters (India) , (1983), 431-440.
  8. Rao, S. B. , "Characterizations of harmonious marked graphs and consistent nets''. J. Combin. Inform System Sci. 9, (1984), 97-112.
  9. Hoede C. , A characterization of consistent marked graphs, J. Graph Theory, 16 (1992): pp. 17- 23.
  10. Roberts F. S, Graph Theory and Its Application to Social Science, Regional Conference Series in Applied Mathematics, (1978).
  11. Chartrand, G. , Introductoty Graph Theory. Chapter 8: Graphs and Social , New York: Dover Publications, Inc, (1985): 171-182.
Index Terms

Computer Science
Information Sciences

Keywords

Signed graph balanced theory transport network partitionable and non partitionable signed graphs.

Powered by PhDFocusTM