Geodesic
On an Algorithm for Ordering of Graphs
Canadian mathematical bulletin, Tome 14 (1971) no. 2, pp. 221-224

Voir la notice de l'article provenant de la source Cambridge

DOI

Let (G, ρ) be a finite connected (undirected) graph without loops and multiple edges. So x, y being two elements of G (vertices of the graph (G, ρ)), 〈x, y〉 ∊ ρ means that x and y are connected by an edge. Two vertices x, y ∊ G have the distance μ(x, y) equal to n, if n is the smallest number with the following property: there exists a sequence x 0, x 1, ..., xn of vertices such that x 0 =x, xn = y and 〈x i-1, Xi 〉 ∊ ρ for i = 1, ..., n. If x ∊ G, we put μ(x, x) = 0. 
Sekanina, Milan. On an Algorithm for Ordering of Graphs. Canadian mathematical bulletin, Tome 14 (1971) no. 2, pp. 221-224. doi: 10.4153/CMB-1971-037-7
@article{10_4153_CMB_1971_037_7,
     author = {Sekanina, Milan},
     title = {On an {Algorithm} for {Ordering} of {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {221--224},
     year = {1971},
     volume = {14},
     number = {2},
     doi = {10.4153/CMB-1971-037-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-037-7/}
}
TY  - JOUR
AU  - Sekanina, Milan
TI  - On an Algorithm for Ordering of Graphs
JO  - Canadian mathematical bulletin
PY  - 1971
SP  - 221
EP  - 224
VL  - 14
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-037-7/
DO  - 10.4153/CMB-1971-037-7
ID  - 10_4153_CMB_1971_037_7
ER  - 
%0 Journal Article
%A Sekanina, Milan
%T On an Algorithm for Ordering of Graphs
%J Canadian mathematical bulletin
%D 1971
%P 221-224
%V 14
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-037-7/
%R 10.4153/CMB-1971-037-7
%F 10_4153_CMB_1971_037_7

Cité par Sources :