| Popis: |
In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index r of a graph G , denoted by ℒ r ( G ) . The vertices of ℒ r ( G ) are the r -subsets of E ( G ) , and two vertices S and T are adjacent if there exist s ∈ S and t ∈ T such that s and t are adjacent edges in G . They also defined the line completion number l c ( G ) of graph G to be the minimum index r for which ℒ r ( G ) is complete. They found the line completion number for certain classes of graphs. In this paper, we find the line completion number of hypercube Q n for every n . |
