Results 21 to 30 of about 17,946 (257)
Radio Labelings of Lexicographic Product of Some Graphs
Journal of Mathematics, 2021 Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different ...
Muhammad Shahbaz Aasi +3 more
doaj +1 more source
Application of Artificial Intelligence for Better Investment in Human Capital
Mathematics, 2023 Selecting candidates for a specific job or nominating a person for a specific position takes time and effort due to the need to search for the individual’s file. Ultimately, the hiring decision may not be successful.
Mohammed Abdullah Ammer +4 more
doaj +1 more source
Mapana - Journal of Sciences, 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 edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this
A Lourdusamy, S Jenifer Wency, F Patrick
openaire +1 more source
Indonesian Journal of Combinatorics, 2020 In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices.
Christian Barrientos
doaj +1 more source
The odd harmonious labeling of matting graph
Journal of Physics: Conference Series, 2021 Abstract Let G(p, q) be a graph that consists of p vertices and q edges, where V is the set of vertices and E is the set of edges of G. A graph G(p, q) is odd harmonious if there exists an injective function f that labels the vertices of G by integer from 0 to 2q − 1 that induced a bijective function f ∗ defined by f
K Mumtaz, P John, D R Silaban
openaire +1 more source
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
Odd harmonious labeling of two graphs containing star [PDF]
AIP Conference Proceedings, 2021 An odd harmonious labeling of a graph G is an injective function f:V(G)→{ 0,1,2,…,2| E(G) |−1 } such that the induced function f*:E(G)→{ 1,3,…,2| E(G) |−1 } defined by f*(xy)=f(x)+f(y) is a bijection. A graph that admits odd harmonious labeling is called an odd harmonious graph.
Diah Ayu Pujiwati +2 more
openaire +1 more source
Odd Harmonious Labeling on Pleated of the Dutch Windmill Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2017 A graph G(p,q) with p=|V(G)| vertices and q=|E(G)| edges. The graph G(p,q) is said to be odd harmonious if there exist an injection f: V(G)-{0,1,2,...,2q-1} such that the induced function f*: E(G)-{1,2,3,...,2q-1} defined by f*(uv)=f(u)+f(v) which is a ...
Fery Firmansah, Muhammad Ridlo Yuwono
doaj +1 more source
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
Harmonious labeling on prisms graph
Journal of Physics: Conference Series, 2019 Abstract In this paper, we show that C 2a+1 × Pn and ( C
N Hinding, W Husain, J Massalesse
openaire +1 more source