Published May 1, 2011 | Version v1

Vertex-Mean Graphs

Description

A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or Smarandachely 0 V -mean graph is called a vertex-mean labeling and a vertex-mean graph or V -mean graph, respectively.

Files

VertexMeanGraphs.pdf

Files (164.6 kB)

Name Size Download all
md5:2cb88f46661882e6804d412e4ef39752
164.6 kB Preview Download