Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

On the Line Graph of the Complete Bipartite Graph

A. J. Hoffman
The Annals of Mathematical Statistics
Vol. 35, No. 2 (Jun., 1964), pp. 883-885
Stable URL: http://www.jstor.org/stable/2238547
Page Count: 3
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On the Line Graph of the Complete Bipartite Graph
Preview not available

Abstract

In an interesting recent article [4], J. W. Moon has given a list of properties of the graph L(Bmn) (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case m = n, this question had been settled by Shrikhande [5] (see also [1], [2] and [3]), who proved that the answer was yes unless m = n = 4, when there is exactly one exception. In case $m > n$, Moon shows that the answer is yes unless (m, n) = (5, 4) or (4, 3), which cases were left unsettled in [4]. The purpose of this note is to show that, in those cases as well, the answer is yes, thus completing Moon's discussion. Now to define our problem more exactly. The line graph of the complete bipartite graph on sets with m and n vertices, denoted by L(Bmn), is the graph with mn vertices given by all ordered pairs (i, j), 1 ≤ i ≤ m, 1 ≤ j ≤ n. Two vertices (i, j) and (i', j') are joined by an edge if i = i' or j = j', but not both. The graph L(Bmn) has the following properties: (1.1) It has mn vertices. (1.2) Each vertex has valence m + n - 2. (1.3) If two vertices are not adjacent, there are exactly two vertices adjacent to each. (1.4) Of the 1/2 mn(m + n - 2) pairs of adjacent vertices, exactly $n\binom{m}{2}$ pairs are each adjacent to exactly m - 2 vertices, the remaining $m\binom{n}{2}$ pairs are each adjacent to exactly n - 2 vertices. We now assume $m > n$, and let Gmn be any graph satisfying (1.1)-(1.4). Our object is to prove that when (m, n) = (5, 4) or (4, 3), Gmn = L(Bmn). Moon has established Gmn = L(Bmn) in all other cases.

Page Thumbnails

  • Thumbnail: Page 
883
    883
  • Thumbnail: Page 
884
    884
  • Thumbnail: Page 
885
    885