Weighted directed graph: a Petri net-based method of extraction of closed weighted directed Euler trail
by Sunita Kumawat
International Journal of Services, Economics and Management (IJSEM), Vol. 4, No. 3, 2012

Abstract: This paper investigates the closed weighted directed Euler trail using sign incidence matrix and siphon-trap matrix of Petri net (PN) model of weighted directed graph. We obtain all set of places those are siphon as well as trap using the siphon-trap and bounded-ness property of PN, by operating Boolean addition on elements of columns in sign incidence matrix representation of PN model. The union of such all set of places will constitutes a partition of the edge set of the original graph. Then edges corresponding to these places will forms a closed weighted Euler trail, which ensure that graph is Eulerian graph.

Online publication date: Sat, 15-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services, Economics and Management (IJSEM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com