Geodesics and steps in a connected graph

Ladislav Nebeský

Czechoslovak Mathematical Journal (1997)

  • Volume: 47, Issue: 1, page 149-161
  • ISSN: 0011-4642

How to cite

top

Nebeský, Ladislav. "Geodesics and steps in a connected graph." Czechoslovak Mathematical Journal 47.1 (1997): 149-161. <http://eudml.org/doc/30354>.

@article{Nebeský1997,
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {paths in graphs; geodesics},
language = {eng},
number = {1},
pages = {149-161},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Geodesics and steps in a connected graph},
url = {http://eudml.org/doc/30354},
volume = {47},
year = {1997},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - Geodesics and steps in a connected graph
JO - Czechoslovak Mathematical Journal
PY - 1997
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 47
IS - 1
SP - 149
EP - 161
LA - eng
KW - paths in graphs; geodesics
UR - http://eudml.org/doc/30354
ER -

References

top
  1. Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979, . MR0525578
  2. Graph Theory, Addison-Wesley, Reading (Mass.) 1969. Zbl1161.05345MR0256911
  3. 10.4153/CJM-1965-034-0, Canad. J. Math. 17 (1965), 342–346. (1965) MR0175113DOI10.4153/CJM-1965-034-0
  4. The Interval Function of a Graph, Mathematisch Centrum. Amsterdam 1980. MR0605838
  5. A characterization of the set of all shortest paths in a connected graph, Mathematica Bohemica 119 (1994), 15–20. (1994) MR1303548
  6. A characterization of the interval function of a connected graph, Czechoslovak Math. J. 44 (119) (1994), 173–178. (1994) MR1257943
  7. Visibilities and sets of shortest paths in a connected graph, Czechoslovak Math. J. 45(120) (1995), 563–570. (1995) MR1344521
  8. On the set of all shortest paths of a given length in a connected graph, Czechoslovak Math. J. 46(121) (1996), 155–160. (1996) MR1371697

Citations in EuDML Documents

top
  1. Ladislav Nebeský, Characterizing the interval function of a connected graph
  2. Ladislav Nebeský, A new proof of a characterization of the set of all geodesics in a connected graph
  3. Ladislav Nebeský, An algebraic characterization of geodetic graphs
  4. Ladislav Nebeský, On the distance function of a connected graph
  5. Henry Martyn Mulder, Ladislav Nebeský, Leaps: an approach to the block structure of a graph
  6. Henry Martyn Mulder, Ladislav Nebeský, Modular and median signpost systems and their underlying graphs
  7. Ladislav Nebeský, A theorem for an axiomatic approach to metric properties of graphs
  8. Ladislav Nebeský, On properties of a graph that depend on its distance function
  9. Ladislav Nebeský, Signpost systems and spanning trees of graphs
  10. Ladislav Nebeský, An axiomatic approach to metric properties of connected graphs

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.