Abstract Views :159 |
PDF Views:0
Authors
Affiliations
1 Department of Mathematics, A.V.V.M. Sri Pushpam College Poondi - Thanjavur -613 503, IN
2 Department of Mathematics A.V.V.M. Sri Pushpam College Poondi, Thanjavur - 613 503, IN
3 Department of Mathematics, St. John's College Palayamkottal - 627 002, IN
Source
Journal of the Ramanujan Mathematical Society, Vol 6, No 1-2 (1991), Pagination: 1-8
Abstract
For a nonnegative integer k, a graph G = (V, E) with | V( G)| > k ( k + 1 ) / 2 is defined to be k - balanced if {| E ( H ) | / (| V ( H) | - k)} ≤ {| E ( G) | / ( | V ( G ) | - k)} for every subgraph H of G with |V ( H) | > k. When k = 0 and 1 this coincides with balanced graphs of Erd6s and Renyi and strongly balanced graphs of Rucinski and Vince, respectively. In this paper we investigate some properties of k - balanced graphs. Given, any two integers p and q with suitable