Independence number in path graphs

被引:0
|
作者
Knor, M
Niepel, L
机构
[1] Slovak Univ Technol Bratislava, Fac Civil Engn, Dept Math, Bratislava 81368, Slovakia
[2] Kuwait Univ, Fac Sci, Dept Math & Comp Sci, Safat 13060, Kuwait
关键词
path graph; independence number; iterated line graph; graph dynamics; (non)deterministic algorithm;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:179 / 187
页数:9
相关论文
共 50 条
  • [1] INDEPENDENCE NUMBER, MINIMUM DEGREE AND PATH-FACTORS IN GRAPHS
    Wang, Sufang
    Zhang, Wei
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2022, 23 (03): : 229 - 234
  • [2] Independence number and minimum degree for path-factor critical uniform graphs
    Liu, Hongxia
    Pan, Xiaogang
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 153 - 158
  • [3] A logspace approximation scheme for the shortest path problem for graphs with bounded independence number
    Tantau, T
    STACS 2004, PROCEEDINGS, 2004, 2996 : 326 - 337
  • [4] ON THE INDEPENDENCE NUMBER OF RANDOM GRAPHS
    FRIEZE, AM
    DISCRETE MATHEMATICS, 1990, 81 (02) : 171 - 175
  • [5] On the strength and independence number of graphs
    Ichishima, Rikio
    Muntaner-Batle, Francesc A.
    Takahashi, Yukio
    CONTRIBUTIONS TO MATHEMATICS, 2022, 6 : 25 - 29
  • [6] ON THE INDEPENDENCE NUMBER OF SPARSE GRAPHS
    SHEARER, JB
    RANDOM STRUCTURES & ALGORITHMS, 1995, 7 (03) : 269 - 271
  • [7] Independence number of graphs with a prescribed number of cliques
    Bohman, Tom
    Mubayi, Dhruv
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (02):
  • [8] INDEPENDENCE AND DOMINATION IN PATH GRAPHS OF TREES
    Niepel, Ludovit
    Cerny, Anton
    COMPUTING AND INFORMATICS, 2008, 27 (04) : 581 - 591
  • [9] Bounds for the independence number of critical graphs
    Brinkmann, G
    Choudum, SA
    Grünewald, S
    Steffen, E
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2000, 32 : 137 - 140
  • [10] ON THE INDEPENDENCE NUMBER OF RANDOM CUBIC GRAPHS
    FRIEZE, A
    SUEN, S
    RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (05) : 649 - 664