Results 41 to 50 of about 1,092,292 (254)

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

SUPER EDGE MAGIC GRACEFUL TOTAL LABELING OF SOME GRAPHS [PDF]

, 2019
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vertices is p, and the number of edges is q. The edge magic graceful total labeling of graph G is a bijection from V G E G ( ) ( ) to the integers {1, 2,.
Wahyudi, Zainatul Fatimah Mutiara
core   +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

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

Edge even graceful labeling of some graphs [PDF]

Journal of the Egyptian Mathematical Society, 2019
L'étiquetage Edge even gracieux est un nouveau type d'étiquetage depuis son introduction en 2017 par Elsonbaty et Daoud (Ars Combinatoria 130:79–96, 2017). Dans cet article, nous avons obtenu un marquage uniforme et gracieux pour certains graphiques liés au chemin comme l'arbre Y-, l'étoile double Bn,m, 〈le graphique K1,2n : K1,2m〉, le graphique $ ~P_ ...
openaire   +1 more source

An Investigation on the Edge-gracefulness of Bubble Sort, Bubble Sort Star, and Kulli-Cycle Windmill Graphs

Science and Technology Indonesia
A fundamental area of graph theory, graph labeling concerns the assignment of integers to the vertices, edges, or both of a graph under specified constraints. One of the many types of graph labeling is edge-graceful labeling.
John Rafael M. Antalan, Richard Tagle, Aaron Angel, John Loureynz F. Gamurot   +3 more
doaj   +1 more source

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

Advanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

Limits to the Hall Effect and Other Nonreciprocal Effects in Three‐Dimensional Metamaterials

Advanced Materials, EarlyView.
Comprehensive and fundamental bounds on nonreciprocal effects in three‐dimensional metamaterials are derived. They reveal that the effective Hall mobility cannot exceed the largest constituent mobility, that, under certain conditions, the Verdet constant cannot be enhanced, and that, for constituents with Hall coefficients of the same sign, the largest
Christian Kern, Graeme W. Milton
wiley   +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

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