Journal of the Ramanujan Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

On k-Balanced Graphs


Affiliations
1 Department of Mathematics, A.V.V.M. Sri Pushpam College Poondi - Thanjavur -613 503, India
2 Department of Mathematics A.V.V.M. Sri Pushpam College Poondi, Thanjavur - 613 503, India
3 Department of Mathematics, St. John's College Palayamkottal - 627 002, India
     

   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
Notifications
Font Size

Abstract Views: 241

PDF Views: 0




  • On k-Balanced Graphs

Abstract Views: 241  |  PDF Views: 0

Authors

N. Veerapandiyah
Department of Mathematics, A.V.V.M. Sri Pushpam College Poondi - Thanjavur -613 503, India
P. N. Ramachandran
Department of Mathematics A.V.V.M. Sri Pushpam College Poondi, Thanjavur - 613 503, India
S. Arumugam
Department of Mathematics, St. John's College Palayamkottal - 627 002, India

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