Graph labeling
JA Gallian - The electronic journal of combinatorics, 2012 - combinatorics.org
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
[PDF][PDF] Total mean cordiality of umbrella, butterfly and dumbbell graphs
R Ponraj, SS Narayanan… - Jordan J. Math. and Stat …, 2015 - academia.edu
Jordan Journal of Mathematics and Statistics (JJMS) 8(1), 2015, pp 59 - 77 TOTAL MEAN
CORDIALITY OF UMBRELLA, BUTTERFLY AND DUMB Page 1 Jordan Journal of Mathematics …
CORDIALITY OF UMBRELLA, BUTTERFLY AND DUMB Page 1 Jordan Journal of Mathematics …
[PDF][PDF] Some results on total mean cordial labeling of graphs
R Ponraj, SS Narayanan - International J. Math. Combin, 2015 - researchgate.net
A graph G=(V, E) with p vertices and q edges is said to be a Total Mean Cordial graph if
there exists a function f: V (G)→{0, 1, 2} such that for each edge xy assign the label⌈ f (x)+ f …
there exists a function f: V (G)→{0, 1, 2} such that for each edge xy assign the label⌈ f (x)+ f …
[图书][B] International Journal of Mathematical Combinatorics, Volume 2, 2015
L Mao - books.google.com
The International J. Mathematical Combinatorics is a fully refereed international journal,
sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly …
sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly …
[PDF][PDF] Total mean cordiality of some derived graphs
R Ponraj, SS Narayanan - Bull. inter. Math. Virtual Institute, 2015 - researchgate.net
A total mean cordial labeling of a graph G=(V, E) is a function f: V (G)→{0, 1, 2} such that for
each edge xy assign the label⌈ f (x)+ f (y) 2⌉ where x, y∈ V (G) and∣∣ evf (i)− evf (j)∣∣ …
each edge xy assign the label⌈ f (x)+ f (y) 2⌉ where x, y∈ V (G) and∣∣ evf (i)− evf (j)∣∣ …