Independence number in path graphs
In the paper we present results, which allow us to compute the independence numbers of P-2-path graphs and P-3-path graphs of special graphs. As P-2(G) and P-3(G) are subgraphs of iterated line graphs L-2(G) and L-3(G), respectively, we compare our results with the independence numbers of corresponding iterated line graphs.
independence number path graph iterated line graph graph dynamics (non)deterministic algorithm