Skip to main content

Table 1 The upper bound for the number of edges of a graph with n vertices

From: Further results on Parity Combination Cordial Labeling

nUpper bound|Kn|nUpper bound|Kn|nUpper bound|Kn|
211353815956812292278
333363856306912412346
456373976667012532415
5910384097037112812485
61315394377417212852556
71921404417807312972628
82528414538207413092701
92936424658617513372775
103345434939037613492850
114555445059467713772926
124966455339907814053003
1361784656110357914653081
1473914762110818014693160
151011054862511288114813240
161011204963711768214933321
171051365064912258315213403
181091535167712758415333486
191211715268913268515613570
201251905371713788615893655
211372105474514318716493741
221492315580514858816613828
231772535681715408916893916
241812765784515969017174005
251933005887316539117774095
262053255993317119218054186
272333516096117709318654278
2824537861102118309419254371
2927340662108118919520494465
3030143563120519539620534560
3136146564120520169720654656
3236149665120920809820774753
3336552866121321459921054851
34369561671225221110021174950