The line completion number of hypercubes

Abstract

In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also defined the line completion number of graph G to be the minimum index for which is complete. They found the line completion number for certain classes of graphs. In this paper, we find the line completion number of hypercube for every .

Keywords

• super line graph
• line completion number
• induced subgraph
• hypercube