On graphs whose star complement for <f>−2</f> is a path or a cycle

It was proved recently by one of the authors that, if <f>H</f> is a path <f>Pt</f> (<f>t>2</f> with <f>t≠7</f> or 8) or an odd cycle <f>Ct</f> (<f>t>3</f>), then there is a unique maximal graph having <f>H</f> as a star complement for <f>−2</f>. The methods employed were analytical in nature, making use of the Reconstruction Theorem for star complements. Here we offer an alternative approach, based on the forbidden subgraph technique. In addition, we resolve the exceptional situations arising when <f>H=P7</f> or <f>P8</f>. [Copyright &y& Elsevier]