On a Class of Directed Graphs—With an Application to Traffic-Flow Problems

Loh Hooi-Tong
Additional contact information
Loh Hooi-Tong: University of Malaya Kuala Lumpur, Malaysia

Operations Research, 1970, vol. 18, issue 1, 87-94

Abstract: Let G be a directed graph such that even edge e of G is associated with a positive integer, called the index of e . Then G is called a network graph if, at every vertex v of G , the sum of the indices of the edges terminating at v is equal to that of the edges incident from v . This paper obtains several theorems giving necessary and sufficient conditions for v directed graph to be a network graph, and applies the results to solving some problems of smoothing traffic flow.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.87 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:1:p:87-94

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().