Institute of Informatics, Slovak Academy of Sciences
Publication date
26/01/2012
Field of study
The problems of determining the maximum cardinality of an independent set of vertices and the minimum cardinality of a maximal independent set of vertices of a graph are known to be NP-complete. We provide efficient algorithms for finding these values for path graphs of trees
Institute of Informatics, Slovak Academy of Sciences
Publication date
06/02/2012
Field of study
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