Line completion number of grid graph P_n P_m

Publication date 9 September 2021

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

,

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

l c (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} i m e s P_{m}

for various cases of

n

and

m

.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Line completion number of grid graph \(P_n\times P_m\)