期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2019
卷号：16
期号：1
页码：78-82
DOI：10.1016/j.akcej.2018.02.003
语种：English
出版社：Elsevier
摘要：AbstractIn 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of indexrof a graphG,denoted byℒr(G).The vertices ofℒr(G)are ther-subsets ofE(G),and two verticesSandTare adjacent if there exists∈Sandt∈Tsuch thatsandtare adjacent edges inG.They also defined the line completion numberlc(G)of graph G to be the minimum indexrfor 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 hypercubeQnfor everyn.
关键词：KeywordsSuper line graphLine completion numberInduced subgraphHypercube
