Institute of Informatics, Slovak Academy of Sciences
Abstract
In the paper we present results, which allow us to compute the independence numbers of P2-path graphs and P3-path graphs of special graphs. As P2(G) and P3(G) are subgraphs of iterated line graphs L2(G) and L3(G), respectively, we compare our results with the independence numbers of corresponding iterated line graphs