On the Cube of a Graph
Canadian mathematical bulletin, Tome 11 (1968) no. 2, pp. 295-296
Voir la notice de l'article provenant de la source Cambridge
The nth power Gn of a connected graph G is the graph with the same point set as G and where two points u and v are adjacent in Gn if and only if the distance between u and v in G is at most n. The graph G2 is called the square of G while G3 is referred to as the cube of G.
Karaganis, Jerome J. On the Cube of a Graph. Canadian mathematical bulletin, Tome 11 (1968) no. 2, pp. 295-296. doi: 10.4153/CMB-1968-037-0
@article{10_4153_CMB_1968_037_0,
author = {Karaganis, Jerome J.},
title = {On the {Cube} of a {Graph}},
journal = {Canadian mathematical bulletin},
pages = {295--296},
year = {1968},
volume = {11},
number = {2},
doi = {10.4153/CMB-1968-037-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1968-037-0/}
}
Cité par Sources :