Movatterモバイル変換


[0]ホーム

URL:



Content

Advances and Applications in Discrete Mathematics
Advances and Applications in Discrete Mathematics
Volume 18, Issue 1, Pages 45 - 56 (January 2017)
http://dx.doi.org/10.17654/AADMJan2017_045_056

THEk-INDEPENDENT GRAPH OF A GRAPH


Davood Fatehi, Saeid Alikhani and Abdul Jalil M. Khalaf

Abstract:

Let be a simple graph. A set is an independent set, if no two of its members are adjacent inG. Thek-independent graph ofG, is defined to be the graph whose vertices correspond to the independent sets ofG that have cardinality at mostk. Two vertices in are adjacent if and only if the corresponding independent sets ofG differ by either adding or deleting a single vertex. In this paper, we obtain some properties of and compute it for some graphs.

Keywords and phrases:

independence number,k-independent graph, reconfiguration.

Number of Downloads: 388 |Number of Views: 1458
Previous    Next
 P-ISSN: 0974-1658
 E-ISSN: 3049-2157
Journal Stats
Publication count: 637
Citation count (Google Scholar): 1099
h10-index (Google Scholar): 30
h-index (Google Scholar): 16
Downloads : 158568
Views: 732811
Downloads/publish articles: 248.93
Citations (Google Scholar)/publish articles: 1.73
 
   
Copyright 2012
This website is best viewed at 1024x768 or higher resolution with Microsoft Internet Explorer 6 or newer.


[8]ページ先頭

©2009-2025 Movatter.jp