Results 41 to 50 of about 29,676 (268)
Edge even graceful labelling of some book graphs [PDF]
Journal of Taibah University for Science, 2018 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling if there is a bijection f from the edges of the graph to the set $\{2, 4,\ldots , 2q\}$ such that, when each vertex is assigned the sum of all edges incident to it mod $2k$, where $k = \max (\,p,q )$, the resulting ...
S.N. Daoud, Ahmed N. Elsawy
openaire +2 more sources
Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling
European Journal of Pure and Applied MathematicsThe Paley graph Pq is a simple connected strongly regular graph with (q, q−1/2 , q−5/4 , q−1/4 ) as its parameters, where V (Pq) is the finite field Fq of order q = pn, p is an odd prime, n ∈ N, and q ≡ 1 (mod 4).
A. N. Elsawy, Reyoud Nasser Almohammadi
semanticscholar +1 more source
Nowhere-zero modular edge-graceful graphs [PDF]
, 2012 For a connected graph G of order n ≥ 3, let f: E(G) → ℤₙ be an edge labeling of G. The vertex labeling f': V(G) → ℤₙ induced by f is defined as $f'(u) = ∑_{v ∈ N(u)} f(uv)$, where the sum is computed in ℤₙ. If f' is one-to-one, then f is called a modular
Jones, Ryan, Zhang, Ping
core +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
Special Graceful Labelings of Irregular Fences and Lobsters
Universal Journal of Mathematics and Applications, 2019 Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source
Super edge-antimagic graceful labeling of graphs
Malaya Journal of Matematik, 2015 For a graph $G=(V, E)$, a bijection $g$ from $V(G) \cup E(G)$ into $\{1,2, \ldots,|V(G)|+|E(G)|\}$ is called $(a, d)$-edge-antimagic graceful labeling of $G$ if the edge-weights $w(x y)=|g(x)+g(y)-g(x y)|, x y \in E(G)$, form an arithmetic progression starting from $a$ and having a common difference $d$.
null G. Marimuthu, null P. Krishnaveni
openaire +1 more source
On edge graceful labelings of disjoint unions of $2r$-regular edge graceful graphs
, 2006 We prove that if $G$ is a $2r$-regular edge graceful $(p,q)$ graph with $(r,kp)=1$ then $kG$ is edge graceful for odd $k$. We also prove that for certain specific classes of $2r$-regular edge graceful graphs it is possible to drop the requirement that $(r,kp)=1$
Riskin, Adrian, Weidman, Georgia
openaire +2 more sources
D-Graceful Labeling of a Path [PDF]
, 2016 [[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative integer set D. A D-graceful labeling f of G is an injection f : V → D such that {|f(x) − f(y)| ¯¯ xy ∈ E} = {1, 2, 3, . . . , |E|}.
顏經和 +3 more
core
Advanced Healthcare Materials, EarlyView.A biocompatible sodium alginate‐based hydrogel is developed as a next‐generation submucosal lifting agent intended for EMR and ESD. The optimized formulation exhibits a composition devoid of endotoxins, high viscosity, demonstrates reliable injectability, and ensures prolonged mucosal elevation.
Iram Maqsood +9 more
wiley +1 more source
On the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs, 2017 A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj +1 more source