### Abstract

A nontrivial connected graph G is called even if for each vertex v of G there is a unique vertex [bar v] such that d(v,[bar v]) = diam G. Special classes of even graphs are defined and compared to each other. In particular, an even graph G is called symmetric if d(u,v) + d(u,[bar v]) = diam G for all u, v V(G). Several properties of even and symmetric even graphs are stated. For an even graph of order n and diameter d other than an even cycle it is shown that n ≥ 3d - 1 and conjectured that n ≥ 4d - 4. This conjecture is proved for symmetric even graphs and it is shown that for each pair of integers n, d with n even, d ≥ 2 and n ≥ 4d - 4 there exists an even graph of order n and diameter d. Several ways of constructing new even graphs from known ones are presented.

Original language | Undefined |
---|---|

Pages (from-to) | 225-239 |

Journal | Journal of graph theory |

Volume | 10 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1986 |

### Keywords

- IR-70817

## Cite this

Gobel, F., & Veldman, H. J. (1986). Even graphs.

*Journal of graph theory*,*10*(2), 225-239. https://doi.org/10.1002/jgt.3190100212