Independence Number in Path Graphs
Martin Knor ; Ľudovít Niepel
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  Path graph; independence number; iterated line graph; graph dynamics; (non)deterministic algorithm 
@article{cai414,
     author = {Martin Knor and \v Ludov\'\i t Niepel},
     title = {Independence Number in Path Graphs},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai414}
}

Martin Knor; Ľudovít Niepel. Independence Number in Path Graphs. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai414/