On even graphs
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1998
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1955 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_masteral-8793 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_masteral-87932021-01-28T13:00:33Z On even graphs Muhi, Liza Marie T. 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. 1998-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_masteral/1955 Master's Theses English Animo Repository Graph theory Combinatorial analysis Mathematics Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Graph theory Combinatorial analysis Mathematics Mathematics |
| spellingShingle |
Graph theory Combinatorial analysis Mathematics Mathematics Muhi, Liza Marie T. On even graphs |
| description |
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. |
| format |
text |
| author |
Muhi, Liza Marie T. |
| author_facet |
Muhi, Liza Marie T. |
| author_sort |
Muhi, Liza Marie T. |
| title |
On even graphs |
| title_short |
On even graphs |
| title_full |
On even graphs |
| title_fullStr |
On even graphs |
| title_full_unstemmed |
On even graphs |
| title_sort |
on even graphs |
| publisher |
Animo Repository |
| publishDate |
1998 |
| url |
https://animorepository.dlsu.edu.ph/etd_masteral/1955 |
| _version_ |
1772835613560537088 |