Let G be a finite non-abelian group and Z(G) its center. We associate commuting graph $$\Gamma (G)$$ to G, whose vertex set is $$G\setminus Z(G)$$ two distinct vertices are adjacent if they commute. In this paper we prove that the of all groups has maximum degree bounded above by fixed $$k \in {\mathbb {N}}$$ finite. Also, characterize for which associated graphs have at most 4.

the paper explores the research productivity of the journal vikalpa for the    period of 2003-2012, which is indexed in the ebsco on-line database. various quality aspects of the 437 research articles published in the period were studied. the study elaborates on various aspects of the journal such as year wise distribution of the articles, growth rate of articles, authorship pattern, and degree...