Results 21 to 30 of about 2,286 (90)
Improved Bounds for Relaxed Graceful Trees [PDF]
, 2016 We introduce left and right-layered trees as trees with a specific representation and define the excess of a tree. Applying these ideas, we show a range-relaxed graceful labeling which improves on the upper bound for maximum vertex label given by Van ...
Barrientos, Christian, Krop, Elliot
core +1 more source
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
, 2010 In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper,
Moussa, M. Ibrahim
core +2 more sources
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Some New Graceful Generalized Classes of Diameter Six Trees [PDF]
, 2017 Here we denote a {\it diameter six tree} by $(c; a_{1}, a_{2}, \ldots, a_{m}; b_{1}, b_{2}, \ldots, b_{n}; c_{1}, c_{2}, \ldots, c_{r})$, where $c$ is the center of the tree; $a_{i}, i = 1, 2, \ldots, m$, $b_{j}, j = 1, 2, \ldots, n$, and $c_{k}, k =
Mishra, D. (Debdas) +2 more
core +2 more sources
Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]
, 2014 Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Djuwandi, D. (Djuwandi) +2 more
core
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +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
Kinetic Contribution to the Arbitrary Order Odd Frequency Moments of the Dynamic Structure Factor
Contributions to Plasma Physics, EarlyView.ABSTRACT An exact expression is derived for the kinetic contribution to the odd (arbitrary order) frequency moments of the dynamic structure factor via a finite summation that features averages of even (all lower orders) powers of the momentum over the exact momentum distribution.
Panagiotis Tolias +2 more
wiley +1 more source
Self‐Assembly, Rearrangement, and Disassembly of {Cr6} Horseshoe Oligomers
Angewandte Chemie, Volume 137, Issue 49, December 1, 2025.Using a combination of ion mobility mass spectrometry (IM‐MS), tandem mass spectrometry (MS2), and low‐temperature scanning tunneling microscopy (STM), we elucidate the self‐assembly, rearrangement, and disassembly processes of polymetallic {Cr6}x (x = 1 – 5) horseshoe oligomers.
Niklas Geue +8 more
wiley +2 more sources
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source