The Isomorphism between Graphs and their Adjoint Graphs

1 February 1965

journal article
Published by Canadian Mathematical Society in Canadian Mathematical Bulletin

Vol. 8 (1) , 7-15
https://doi.org/10.4153/cmb-1965-002-7

Abstract

A graph G is defined as a set X = {x₁, …, x_n} of elements x_i called vertices, and a collection Γ of (not necessarily distinct) unordered pairs of distinct vertices, called edges. An edge (x_i, x_j) is said to be incident to x_i and x_j which are its end-vertices.

Keywords

ISOMORPHISM
ADJOINT GRAPHS
UNORDERED
SAID
NECESSARILY
DISTINCT
EDGE

This publication has 1 reference indexed in Scilit:

Theory of Graphs
Published by American Mathematical Society (AMS) ,1962