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 …
Total Mean Cordiality of Kcn + 2K2.
R Ponraj, SS Narayanan - Palestine Journal of Mathematics, 2015 - search.ebscohost.com
Abstract A Total Mean Cordial labeling of a graph G=(V, E) is a mapping f: V (G)→{0, 1, 2}
such that f (xy)=[f (x)+ f (y)/2] where x, y∈ V (G), xy∈ G, and the total number of 0, 1 and 2 …
such that f (xy)=[f (x)+ f (y)/2] where x, y∈ V (G), xy∈ G, and the total number of 0, 1 and 2 …
4-TOTAL MEAN CORDIAL LABELING OF ARROW GRAPHS AND SHELL GRAPHS
R PONRAJ, S SUBBULAKSHMI - Journal of Applied and Pure …, 2023 - koreascience.kr
4-TOTAL MEAN CORDIAL LABELING OF ARROW GRAPHS AND SHELL GRAPHS -Journal
of Applied and Pure Mathematics | Korea Science society@kisti.re.kr Login English 한국어 …
of Applied and Pure Mathematics | Korea Science society@kisti.re.kr Login English 한국어 …
[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 …
In- Mean Cordial Graphs.
DJ Jeba, G Sudhana - Turkish Online Journal of Qualitative …, 2021 - search.ebscohost.com
A graph labeling is an assignment of integers to the vertices or edges or both depending on
certain conditions. A graph G with p vertices and q edges is said to admit I< sub> n-mean …
certain conditions. A graph G with p vertices and q edges is said to admit I< sub> n-mean …
[图书][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)∣∣ …
Further results on total mean cordial labeling of graphs
R Ponraj, S Sathish Narayanan - Journal of Algorithms and Computation, 2015 - jac.ut.ac.ir
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 f (xy)=[(f (x)+ f (y))/2] where x, y∈ V (G), xy∈ E …
exists a function f: V (G)→{0, 1, 2} such that f (xy)=[(f (x)+ f (y))/2] where x, y∈ V (G), xy∈ E …
[PDF][PDF] Total Mean Cordiality of Kc
R Ponraj, SS Narayanan - researchgate.net
Total Mean Cordiality of Kc n + 2K Page 1 Palestine Journal of Mathematics Vol. 4(2) (2015) ,
431–438 © Palestine Polytechnic University-PPU 2015 Total Mean Cordiality of Kc n + 2K2 R …
431–438 © Palestine Polytechnic University-PPU 2015 Total Mean Cordiality of Kc n + 2K2 R …