On even graphs
Date of Publication
1998
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Dr. Severino Gervacio
Defense Panel Chair
Dr. Leonor Ruivivar
Defense Panel Member
Dr. Blessilda Raposa
Rigor Ponsones
Abstract/Summary
A nontrivial connected graph G is called even if for each vertex v of G there is a unique vertex v' such that d(v, v') = diam G = d. Special classes of even graphs are defined and compared to each other specifically that of symmetric even graph which has the following property: d(u, v) + d(u, v') = d for all u, v e V(G). Several properties of even and symmetric even graphs are included. For an even graph of order n and diameter d other than an even cycle, it is shown that n is equal to or greater than 3d-1. Moreover, for a symmetric even graph order n and diameter d, it is shown that n is equal to or greater than 4d-4.
Abstract Format
html
Language
English
Format
Accession Number
TG02834
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
62 leaves
Keywords
Graph theory; Combinatorial analysis; Mathematics
Recommended Citation
Muhi, L. T. (1998). On even graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/1955
