Results for Search: bibliosubject.subject contains Graph theory

Results 20 through 38 of 79 records.
Check All Title Author Copies Available at
[Location - Section (Call number)]

An investigation of Dijkstra's and Bellman-Ford algorithm as solutions to the shortest-path problem / - 2010 - x, 43 leaves.
Garcia, Andrea Estrella C. 1 NLP - General Book (Thesis 511.5 G165i 2010)

An investigation of fibonacci cubes / - 2009 - x, 29 leaves.
Tanagon, Emely P. 1 NLP - General Book (Thesis 512.72 T153i 2009)

Meeting combinations and interval graphs / - 2008 - ix, 32 leaves.
Valdez, Myrna L. 1 NLP - General Book (Thesis 511.6 V233m 2008)

More on cycle derivatives of graphs / - 2007 - xiii, 58 leaves.
Britos, Virgilio V. 1 NLP - General Book (Thesis 511.5 B777m 2007)

Multiattribute hybrid spanning tree problem solution by graph theory and mathematical programming approaches / - 1995 - [vii], 72 leaves.
Carreon, Ma. Cecilia Leonor P. 1 NLP - General Book (Thesis 511.8 C232m 1995)

The Number of paths in a general circularly linear graph / - 1998 - ix, 80 leaves.
Andal, Ermelindo S. 1 NLP - General Book (Thesis 511.5 An22n 1998)

The number of triangles in a complete r-partitegraph / - 1999 - viii, 51 leaves.
Cujardo, Pedro E. 1 NLP - General Book (Thesis 511.5 C896n 1999)

On a characterization of a 3-regular graph to be cordial / ; 2008. - viii, 39 leaves.
Escalante, Jean L. 1 NLP - General Book (Thesis 511.5 Es14o 2008)

On antisymmetrical digraphs / - 1975 - 107 leaves : ; 28 cm.
Lina, Esperanza Flores. 1 NLP - Storage (restricted) ( Thesis 511.5 L631on 1975)

On clique cover and clique covering number of a graph / - 2006 - ix, 34 leaves.
Gella, Frederick S. 1 NLP - General Book (Thesis 511.5 G282o 2006)

On closed geodetic numbers of graphs / - 2007 - xiii, 127 leaves.
Aniversario, Imelda S. 1 NLP - TD (Diss 511.5 An55o 2007)

On convex sets and convexity numbers of some graphs / - 2004 - ix, 57 leaves.
Laja, Ladznar S. 2 NLP - TD (Thesis 516.08 L146o 2004)
NLP - TD (Thesis Abs 516.08 L146o 2004)

On covers, matchings and odd cycles of a graph / - 1980 - vi, 98 leaves.
Uluan, Manuel P. 1 NLP - Storage (restricted) ( Thesis 511.5 Ul8o 1980)

On critical, sensitive and strongly sensitive graphs / - 1990 - 90 leaves.
Fabay, Alfredo C. 2 NLP - Storage (restricted) (Thesis 511.5 F11o 1990)
NLP - General Book (Thesis 511.5 F11o 1990)

On decycling number of some graphs / - 1998 - [vi], 93 leaves.
Milan, Sheila S. 2 NLP - General Book (Thesis 511.5 M589o 1998)
NLP - Storage (restricted) (Thesis 511.5 M314o 1997)

On edge Steiner sets and edge Steiner numbers of graphs / - 2007 - xii, 70 leaves.
Frondoza, Michael B. 1 NLP - General Book (Thesis 511.5 F928o 2007)

On edge-monophonic sets in graphs / - 2007 - xi, 87 leaves.
Dalam, Alexis Bernard A. 1 NLP - General Book (Thesis 511.5 D15o 2007)

On forcing geodetic number of a graph / - 2006 - xi, 53 leaves.
Albia, Jake A. 1 NLP - General Book (Thesis 511.5 Al14o 2006)

On forcing monophonic convexity numbers of graphs / - 2007 - xii, 73 leaves.
Gaquing, Napoleon A. 1 NLP - TD (Diss 516.362 G159o 2007)

On geodesic convexity in graphs / - 2004 - xiii, 124 leaves.
Cagaanan, Gilbert B. 1 NLP - TD (Diss 516.362 C117o 2004)