| Title:
|
New proof of a characterization of geodetic graphs (English) |
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
52 |
| Issue:
|
1 |
| Year:
|
2002 |
| Pages:
|
33-39 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler. (English) |
| Keyword:
|
geodetic graphs |
| Keyword:
|
shortest paths |
| Keyword:
|
binary operations |
| MSC:
|
05C12 |
| MSC:
|
05C75 |
| MSC:
|
20N02 |
| idZBL:
|
Zbl 0995.05124 |
| idMR:
|
MR1885455 |
| . |
| Date available:
|
2009-09-24T10:48:51Z |
| Last updated:
|
2020-07-03 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/127700 |
| . |
| Reference:
|
[1] G. Chartrand and L. Lesniak: Graphs & Digraphs. Third edition.Chapman & Hall, London, 1996. MR 1408678 |
| Reference:
|
[2] H. M. Mulder: The Interval Function of a Graph.Mathematisch Centrum, Amsterdam, 1980. Zbl 0446.05039, MR 0605838 |
| Reference:
|
[3] L. Nebeský: An algebraic characterization of geodetic graphs.Czechoslovak Math. J. 48 (123) (1998), 701–710. MR 1658245, 10.1023/A:1022435605919 |
| Reference:
|
[4] L. Nebeský: A tree as a finite nonempty set with a binary operation.Math. Bohem. 125 (2000), 455–458. MR 1802293 |
| . |
