Results 31 to 40 of about 407,230 (195)
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 +2 more sources
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
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
Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs
International Journal of Innovative Technology and Exploring Engineering, 2020 An even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,...,2q 1 to the vertices through a 1-1 computing function f and even numbers 0, 2, 4,..., 2( p 1) to the edges through a bijective computing function f * with the condition that f *(e uv) ( f (u) f (v))(mod 2q) where u and v are ...
M. Kalaimathi*, Dr. B. J. Balamurugan
openaire +1 more source
On SD-Harmonious Labeling [PDF]
, 2018 A graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every
Patrick, F +2 more
core +1 more source
Pelabelan Harmonis Ganjil pada Kelas Graf Baru Hasil Operasi Cartesian Product [PDF]
, 2017 Graph class which has the characteristic of odd harmonious labeling is called as odd harmonious graph. Net graph is a graph which is gained by using operation Cartesian product of two line graphs.
Muhammad Ridlo Yuwono, Fery Firmansah
core +2 more sources
Measuring the Hall Effect in Hysteretic Materials
Advanced Materials, EarlyView.The authors highlight common pitfalls in measuring the Hall effect: in hysteretic magnets, improper data processing can create signals that look exotic but are not real. This Perspective explains the origin of these artifacts and presents practical measurement strategies that help researchers identify reliable Hall responses in complex magnetic ...
Jaime M. Moya +6 more
wiley +1 more source
Odd harmonious labeling on squid graph and double squid graph
Journal of Physics: Conference Series, 2020 AbstractAn injective functionffrom set of vertices in graphGto a set of {0,1,…,|E| − 1} is called an odd harmonious labeling if the functionfinduced the edge functionf* from the set of edges ofGto a set of odd positive integer number {1,3,5,…,2|E| − 1} withf*(xy) =f(x) +f(y) for every edgexyinE.Graph that has an odd harmonious labeling is called odd ...
F Febriana, K A Sugeng
openaire +1 more source
, 2021 We propose a new puzzle: Label the eight vertices of a cube using distinct integers between 0 and 12 (both inclusive) such that the induced labeling of each edge, given by the sum of the labels of its end points, causes the 12 edges to be labeled with ...
Sarkar, Jyotirmoy, Jyotirmoy Sarkar
core +1 more source
Phase Engineering of Atomically Precise Nanoclusters (APNCs) of Gold and Beyond
Advanced Materials, EarlyView.Engineering the structural phase of materials is of paramount importance for both fundamental research and practical applications. In this Review, we summarize the recent progress in controlling the phases of atomically precise nanoclusters (APNCs) of gold, silver and copper, as well as bimetallic systems. The phase‐enabled material properties of APNCs
Yitong Wang +4 more
wiley +1 more source