Author:
Guy Richard K.,Harary Frank
Abstract
Consider the graph Mn, where n = 2r ≥ 6, consisting of a polygon
of length n and all n/2 chords joining opposite pairs of vertices. This
graph has 2r vertices which we denote by 1, 2, 3,..., 2r, and the 3r
(undirected) edgesWe call Mn the n-ladder, defined thus far only for n even. The
three smallest n-ladders with n even are shown in Figure 1.
Publisher
Canadian Mathematical Society
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献