2 research outputs found

    Independence Number in Path Graphs

    Get PDF
    In the paper we present results, which allow us to compute the independence numbers of P2P_2-path graphs and P3P_3-path graphs of special graphs. As P2(G)P_2(G) and P3(G)P_3(G) are subgraphs of iterated line graphs L2(G)L^2(G) and L3(G)L^3(G), respectively, we compare our results with the independence numbers of corresponding iterated line graphs

    Trees and unicyclic graphs with hamiltonian path graphs

    No full text
    corecore