We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prim...We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prime graphs. Moreover we prove that Wn is a strongly prime graph for every even integer n ≥ 4.展开更多
Let the coronas C<sub>n</sub>⊙K<sub>1</sub> be the polygons with one additional end-point for eachvertex.Thom Grace conjectured that C<sub>n</sub>⊙K<sub>1</sub> are ha...Let the coronas C<sub>n</sub>⊙K<sub>1</sub> be the polygons with one additional end-point for eachvertex.Thom Grace conjectured that C<sub>n</sub>⊙K<sub>1</sub> are harmonious for n even.In this paper,aproof of his conjecture is given.展开更多
文摘We investigate prime labeling for some graphs resulted by identifying any two vertices of some graphs. We also introduce the concept of strongly prime graph and prove that the graphs Cn, Pn, and K1,n are strongly prime graphs. Moreover we prove that Wn is a strongly prime graph for every even integer n ≥ 4.
文摘Let the coronas C<sub>n</sub>⊙K<sub>1</sub> be the polygons with one additional end-point for eachvertex.Thom Grace conjectured that C<sub>n</sub>⊙K<sub>1</sub> are harmonious for n even.In this paper,aproof of his conjecture is given.
