On oriented trails in a class of graphs (with computer program)
This study provides a step-by-step derivation of the non-recurrent formula for the number of distinct oriented trails in a certain class of graphs. Tere is an accompanying computer program that helps compute these numbers.
Saved in:
Main Authors: | Arnaez, Ma. Cristina K., Dua, Cherry A. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1994
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16159 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On graceful graphs
by: Paculba, Marianne S., et al.
Published: (1998) -
The b-chromatic number of power graphs of paths and cycles
by: San Diego, Immanuel T.
Published: (2005) -
A characterization theorem on graph folding
by: Gervacio, Severino V.
Published: (2002) -
Chip firing games on the n-cycles and tree graphs
by: Ching, Mike Lester L.
Published: (1998) -
On distance-regular graphs and (s,c,a,k)-graphs
by: Bautista, Lincoln A.
Published: (1998)