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
来源：
COMPUTING AND INFORMATICS | 2004年 / 23卷 / 02期
关键词：
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 条
  • [21] Independence number of generalized products of graphs
    Mehta, H. S.
    Acharya, U. P.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2020, 13 (01)
  • [22] The independence number of random interval graphs
    de la Vega, W. Fernandez
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1767 : 59 - 62
  • [23] On the k-independence number in graphs
    Bouchou, Ahmed
    Blidia, Mostafa
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 59 : 311 - 322
  • [24] Independence and matching number of some graphs
    Chen, Ming
    Li, Yusheng
    Yang, Yiting
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (04) : 1342 - 1350
  • [25] On the independence number of minimum distance graphs
    Csizmadia, G
    DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 20 (02) : 179 - 187
  • [26] The Independence Number of the Cartesian Product of Graphs
    Friedler, Louis M.
    ARS COMBINATORIA, 2011, 99 : 205 - 216
  • [27] A note on the independence number in bipartite graphs
    Sharifi, Elahe
    Rad, Nader Jafari
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 66 : 344 - 349
  • [28] THE INDEPENDENCE NUMBER OF GRAPHS IN TERMS OF DEGREES
    SELKOW, SM
    DISCRETE MATHEMATICS, 1993, 122 (1-3) : 343 - 348
  • [29] Independence number of de Bruijn graphs
    Lichiardopol, N
    DISCRETE MATHEMATICS, 2006, 306 (12) : 1145 - 1160
  • [30] THE UPPER AND LOWER INDEPENDENCE NUMBER OF GRAPHS
    Marimuthu, G.
    Saraswathy, M. Sivanandha
    Maheshwari, G. Uma
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (01) : 53 - 61
12345