Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.cai.ui.sav.sk:article/414

Independence Number in Path Graphs

Authors
Publication date
6 February 2012
Publisher
Institute of Informatics, Slovak Academy of Sciences

Abstract

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

Similar works

Full text

thumbnail-image

Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)

redirect
oaioai:ojs.cai.ui.sav.sk:article/...
Last time updated on 15/12/2019

This paper was published in Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava).

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.