%0 Journal Article
%T Line completion number of grid graph Pn × Pm
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Kureethara, Joseph Varghese
%A Sebastian, Merin
%D 2021
%\ 12/01/2021
%V 6
%N 2
%P 299-313
%! Line completion number of grid graph Pn × Pm
%K Line graph
%K Super line graph
%K Grid graph
%K Line completion number
%R 10.22049/cco.2021.26884.1156
%X The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least $r$ edges, the super line graph of index $r$, $L_r(G)$, has as its vertices the sets of $r$-edges of $G$, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number $lc(G)$ of a graph $G$ is the least positive integer $r$ for which $L_r(G)$ is a complete graph. In this paper, we find the line completion number of grid graph $P_n times P_m$ for various cases of $n$ and $m$.
%U http://comb-opt.azaruniv.ac.ir/article_14165_3168ef556251b68f7f57b9cb0c2c7e96.pdf