Geodesic
The Isomorphism between Graphs and their Adjoint Graphs
Canadian mathematical bulletin, Tome 8 (1965) no. 1, pp. 7-15

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

DOI

A graph G is defined as a set X = {x1, ..., xn} of elements xi called vertices, and a collection Γ of (not necessarily distinct) unordered pairs of distinct vertices, called edges. An edge (xi, xj) is said to be incident to xi and xj which are its end-vertices. 
Menon, V. V. The Isomorphism between Graphs and their Adjoint Graphs. Canadian mathematical bulletin, Tome 8 (1965) no. 1, pp. 7-15. doi: 10.4153/CMB-1965-002-7
@article{10_4153_CMB_1965_002_7,
     author = {Menon, V. V.},
     title = {The {Isomorphism} between {Graphs} and their {Adjoint} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {7--15},
     year = {1965},
     volume = {8},
     number = {1},
     doi = {10.4153/CMB-1965-002-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-002-7/}
}
TY  - JOUR
AU  - Menon, V. V.
TI  - The Isomorphism between Graphs and their Adjoint Graphs
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 7
EP  - 15
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-002-7/
DO  - 10.4153/CMB-1965-002-7
ID  - 10_4153_CMB_1965_002_7
ER  - 
%0 Journal Article
%A Menon, V. V.
%T The Isomorphism between Graphs and their Adjoint Graphs
%J Canadian mathematical bulletin
%D 1965
%P 7-15
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-002-7/
%R 10.4153/CMB-1965-002-7
%F 10_4153_CMB_1965_002_7

Cité par Sources :