Consider the graph
H
below:
For a positive integer
n
, let
G_(n)
be the graph obtained by attaching a path graph of length
to
in such a way that one end of the path is at vertex
v
and the other at vertex
w
. Find
P_(G_(n))(k)
.