Open Access
Subscription Access
Open Access
Subscription Access
On k-Balanced Graphs
Subscribe/Renew Journal
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
User
Subscription
Login to verify subscription
Font Size
Information
Abstract Views: 235
PDF Views: 0