New proof of a characterization of geodetic graphs
✍ Scribed by Ladislav Nebeský
- Book ID
- 110410566
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 89 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0011-4642
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, we redemonstrate easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of GF(2). The graphs that we consider are simple. A g
A graph can be metrized by assigning a length to each of its edges. Such a graph is said to be geodetic if for each pair of vertices there is a unique geodesic joining them. It is said to be normally geodetic if each of these unique geodesics is one of the geodesics in the usual metrization of the g
The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character
We survey what is known on geodetic graphs of diameter two and discuss the implications of a new strong necessary condition for the existence of such graphs.