Results 21 to 30 of about 5,368 (184)
APPLICATION OF ODD HARMONIOUS LABELLING OF GRAPHS
, 2022 The labelling of discrete structures is an attractive research topic due to its vast range of applications. The current research is looking on strange harmonious labelling. If there exists an onto ff:V(G)→{0,1,2,,2q−1} such that the induced function 𝑓∗:E(G) →{1,3, ,2q−1}defined by f (uv) = f(u) + f(v) is a bijection, the graph G is said to be odd ...
A.Bhavya, K.Selvaraj
openaire +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Odd harmonious labeling of grid graphs
Proyecciones (Antofagasta), 2019 A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function f* : E(G) → {1, 3, · · · , 2q − 1} defined by f∗ (uv) = f (u) + f (v) is a bijection. In this paper we prove that path union of t copies of Pm×Pn, path union of t different copies of Pmᵢ×Pnᵢ where 1 ≤ i ≤ t ...
P. Jeyanthi, S. Philo, Maged Z. Youssef
openaire +4 more sources
Odd harmonious labeling of Sn (m, r) graph
Journal of Physics: Conference Series, 2021 Abstract A graph labeling is an assignment of integers to vertices or edges of a graph subject to certain conditions. There are various kinds of graph labeling, one of them is an odd harmonious labeling. An odd harmonious labeling f of a graph G on q edges is an injective function f from the set of vertices of G to the set {0,1,2,…,2q ...
E A Pramesti, null Purwanto
openaire +2 more sources
ODD HARMONIOUS LABELINGS OF CYCLIC SNAKES
, 2021 In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1. In this paper we generalize this result on cycles by showing that the kCn − snake with string 1,1,…,1 when n ≡ 0 (mod 4) are odd harmonious graph.
openaire +1 more source
On the edge-balanced index sets of product graphs [PDF]
, 2011 We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot +2 more
core +2 more sources
A Note on 1-Edge Balance Index Set [PDF]
, 2012 A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +1 more source
Pelabelan Harmonis Ganjil pada Graf Ular Jaring Berlipat [PDF]
, 2020 Graphs that have odd harmonious labeling properties are called odd harmonious graphs. The purpose of this study to obtain a new graph class construction with its properties, but also to prove that the new graph class has odd harmonious labeling ...
Firmansah, Fery
core +2 more sources
Major Reference Works, Page 290-301., 2021 International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
John P. Sutter C. Chantler +2 more
wiley +2 more sources
A new labeling construction from the -product [PDF]
, 2017 The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a family of super edge-magic ...
López Masip, Susana Clara +2 more
core +4 more sources