Abstract
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 L2(G) and L3(G), respectively, we compare our results with the independence numbers of corresponding iterated line graphs.
Keywords
Cite this article
@article{cai-1336,
author = {Martin Knor and Ľudovít Niepel},
title = {Independence Number in Path Graphs},
journal = {Computing and Informatics},
volume = {23},
number = {2},
pages = {179--187},
year = {2004},
issn = {1335-9150},
url = {https://cai.type.sk/content/2004/2/independence-number-in-path-graphs/}
}
TY - JOUR AU - Martin Knor AU - Ľudovít Niepel TI - Independence Number in Path Graphs JO - Computing and Informatics VL - 23 IS - 2 SP - 179 EP - 187 PY - 2004 SN - 1335-9150 UR - https://cai.type.sk/content/2004/2/independence-number-in-path-graphs/ KW - Path graph KW - independence number KW - iterated line graph KW - graph dynamics KW - (non)deterministic algorithm ER -
Knor, M., & Niepel, Ľ. (2004). Independence Number in Path Graphs. Computing and Informatics, 23(2), 179–187. https://cai.type.sk/content/2004/2/independence-number-in-path-graphs/