Some New Results on Prime Graphs
Loading...
Date
2012-07
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Scientific Research
Abstract
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.
Description
Keywords
Prime Labeling, Prime Graph, Strongly Prime Graph
Citation
Open Journal of Discrete Mathematics, 2012, 2, 99-104