Abstract
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 lc(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 Qn for every n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
