Results 131 to 140 of about 302 (172)
High sensitivity groups with distinct personality patterns: a person-centered perspective. [PDF]
Front PsycholBürger M, Münscher JC, Herzberg PY.
europepmc +1 more source
Correction to “Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers”
Journal of Mathematicsdoaj +1 more source
Cordial labeling of hypertrees
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agnieszka Maria Görlich +1 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Tribonacci Cordial Labeling of Graphs ()
Journal of Applied Mathematics and Physics, 2022 Sarbari Mitra, Soumya Bhoumik
exaly +2 more sources
k-Product cordial labeling of product of graphs
Discrete Mathematics, Algorithms and Applications, 2022In 2012, Ponraj et al. defined k-product cordial labeling as follows: Let [Formula: see text] be a map from [Formula: see text] to [Formula: see text] where [Formula: see text] is an integer, [Formula: see text]. For each edge [Formula: see text] assign the label [Formula: see text] [Formula: see text]. [Formula: see text] is called a k-product cordial
K. Jeya Daisy +3 more
openaire +1 more source
Neighbourhood Cordial and Neighbourhood Product Cordial Labeling of Graphs
International Journal of Mathematics Trends and Technology, 2015In this paper, we introduce the various types of neighbourhood cordial labeling of graphs and present the neighbourhood cordial labeling of kP2,
A Muthaiyan, G. Bhuvanes wari
openaire +1 more source
On k-totally magic cordial labeling of graphs
Discrete Mathematics, Algorithms and Applications, 2015Let G = (V(G), E(G)) be a simple, finite and undirected graph of order n. Given a bijection f: V(G) ∪ E(G) → Zk such that for each edge uv ∈ E(G), f(u) + f(v) + f(uv) is constant C( mod k). Let nf(i) be the number of vertices and edges labeled by i under f.
P. Jeyanthi +2 more
openaire +3 more sources