|
|
|
| P-ISSN: 0972-0960 |
| |
|
|
 |
 |
 |
|
|
Journal Stats
|
|
| Publication count: 1705 |
| Citation count (Google Scholar): 3668 |
| h10-index (Google Scholar): 90 |
| h-index (Google Scholar): 24 |
| Downloads : 341875 |
| Views: 1286100 |
| Downloads/publish articles: 200.51 |
| Citations (Google Scholar)/publish articles: 2.15 |
|
|
-free if Gdoes not contain any member of 
we let 
denote the set of all k-connected 
-free graphs. This paper is concerned with integers 
and 
and a tree T such that 
is finite. Among other results, we show that 
is finite for every 
and every 
