Title of article :
line completion number of grid graph pn × pm
Author/Authors :
kureethara, joseph varghese christ university - department of mathematics, bengaluru, india , sebastian, merin christ university - department of mathematics, bengaluru, india
Abstract :
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, lr(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 lr(g) is a complete graph. in this paper, we find the line completion number of grid graph pn×pm for various cases of n and m.
Keywords :
line graph , super line graph , grid graph , line completion number
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
