Results 61 to 70 of about 1,212,791 (104)
On alpha labeling of tensor product of paths and cycles. [PDF]
Heliyon, 2023 L U, G R.
europepmc +1 more source
Graceful labeling on torch graph
, 2018 Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
core +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Entropy (Basel), 2023 Zhao M, Wang H, Yao B.
europepmc +1 more source
Odd sum labeling of graphs obtained by duplicating any edge of some graphs [PDF]
, 2015 An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=\{1,3,5,\dots,2q-1\}.$ A graph is said to be an odd ...
S. Arockiaraj +5 more
core +1 more source
PELABELAN GRACEFUL GANJIL PADA GRAF DUPLIKASI DAN SPLIT BINTANG [PDF]
, 2018 Graph is not an empty a finite of the objects that called point (vertex) with the couple was not that is the side (edge). The set point denoted by , while the set edge denoted by . Odd graceful labeling on graph with side is a function injective from
Musdalifah, S +2 more
core
Odd Graceful Labeling Of Tensor Product of Some Graphs
, 2013 (G);E(G)) with p vertices and q edges, if there exists an injectionfunction : V (G) ! f0; 1; 2; ; 2q ô€€€ 1g with each edge uv assignedthe label jf(u)ô€€€f(v)j, the resulting edge labels are f1; 3; 5; ; 2qô€€€1g.The tensor product of two graphs, G and H,
G. N. Purohit +2 more
core +1 more source
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Vertex graceful labeling of some classes of graphs
, 2018 A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V → {1, 2, 3, ··· p} such that the induced function f * : E → {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v ...
Balaganesan, P., Santhakumaran, A. P.
core +1 more source
Graceful Labeling on Grids in 3-Dimensions and 4-Dimensions
, 2007 優美標號(Graceful labeling)最早是由Rosa在1966年提出。一個graph G上的端點標號(vertex labeling)所指的是一個vertex的函數f對應到一些數值(即標號)，而G上的每一edge xy 被指定一個由f(x)和f(y)所決定的數值。如果這樣的一個f:V-->{0,1,...|E|}是單射，且指定 edge xy 的數值為|f(x)-f(y)|而所有的edge都被指定不同的數值，則f被稱為一個優美標號。 Rosa提出假說猜測所有的tree都有優美標號 ...
Chen, Yi-xian, 陳奕先
core