Results 31 to 40 of about 793,315 (170)

Pelabelan Harmonis Ganjil pada Kelas Graf Baru Hasil Operasi Cartesian Product [PDF]

open access: yes, 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

Some New Odd Harmonious Graphs

open access: yesInternational Journal of Mathematics and Soft Computing, 2011
A graph which admits odd harmonious labeling is called an odd harmonious graph. In this paper we prove that the shadow graphs of path Pn and star K1,n are odd harmonious. Further we prove that the split graphs of path Pn and star K1,n admit odd harmonious labeling.
N. H. Shah, S. K. Vaidya
openaire   +1 more source

Bragg crystal monochromators

open access: yesMajor 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  

+1 more source

Odd harmonious labeling on squid graph and double squid graph

open access: yesJournal 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

The study of odd graceful and odd strongly harmonious for bipartite graph

open access: yes, 2020
11 pages,6 ...
Wang, Xiuying   +3 more
openaire   +2 more sources

The odd harmonious labelling of nhair-kC 4-snake graph

open access: yesJournal of Physics: Conference Series, 2021
Abstract Let G(p,q) be graph that consists of p = |V| vertices and q = |E| edges, where is the set of vertices and E is the set of edges of G. A graph G(p,q) is odd harmonious if there exist an injective function f: V → {0, 1, 2, …, 2q − 1} that induced a bijective function f ∗:E → {1, 3, 5, …, 2q − 1} defined by f
K Mumtaz, D R Silaban
openaire   +2 more sources

Integration of Reconfigurable p‐Bit and 1R Crossbar Array for Memristive Probabilistic Computing

open access: yesAdvanced Science, EarlyView.
A memristive probabilistic computing system is demonstrated by integrating stochastic p‐bits based on volatile memristors with a 1R crossbar array encoding interaction weights. The system performs weighted‐sum operations across the array and updates p‐bits iteratively.
Keunho Soh   +7 more
wiley   +1 more source

Shear‐Mode Direct Piezoelectric Response of Ferroelectric Nematic Liquid Crystals

open access: yesAdvanced Science, EarlyView.
Periodic shear‐induced electric current measurements are reported on two archetypic ferroelectric nematic liquid crystal compounds. From the temperature, frequency and shear angle dependent results of the first and second harmonic current signals together with temperature and oscillatory rheology measurements, the effective piezoelectric coupling ...
Péter Salamon   +4 more
wiley   +1 more source

Advances in Josephson Junction Materials and Processes Toward Practical Quantum Computing

open access: yesAdvanced Science, EarlyView.
Emerging materials for quantum computing, including crystalline materials, two‐dimensional van der Waals materials, two‐dimensional electron gas systems, ferromagnets, and unconventional (e.g., d‐wave) superconductors, offer opportunities to engineer next‐generation Josephson junctions.
Hyunseong Kim   +11 more
wiley   +1 more source

Factorial Harmonious Graph of a Group

open access: yes, 2021
Consider the commutative group G. The Factorial Harmonious graph of G is the undirected graph with vertex set G and two different vertices a and b are adjacent if   + {f(a) + f(b)}  (mod m) in G is isomorphism.
et. al., M. Angeline Ruba,
core   +1 more source

Home - About - Disclaimer - Privacy