Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-25T08:13:21.178Z Has data issue: false hasContentIssue false
  • English
  • Français

The Isomorphism between Graphs and their Adjoint Graphs

Published online by Cambridge University Press:  20 November 2018

V. V. Menon
V. V. Menon*
Affiliation:
Indian Statistical Institute
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 8 , Issue 1 , February 1965 , pp. 7 - 15
Copyright
Copyright © Canadian Mathematical Society 1965

References

1. Ore, O., Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, 1962, Section 1. 5, problem 5.Google Scholar