Results 81 to 90 of about 1,212,791 (104)
Graceful Labeling of Spider Graphs With at Most Five Legs
A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set 0,1,⋯,q such that, when each edge uv is assigned the label fu−fv, the resulting edge labels are distinct.
A. Panpa, T. Wasuanankul, S. Imnang
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Edge odd graceful labeling of some snake net and pleated snake graphs
AIP Conference Proceedings, 2022Maulidatus Soleha +2 more
exaly +2 more sources
Edge Odd Graceful Labeling of Some Special Graphs
International Journal of Mathematics Trends and Technology, 2018K Thiagarajan
exaly +2 more sources
Odd graceful labeling for the jewel graph and the extended jewel graph without the prime edge*
Bulletin of Pure & Applied Sciences Section E: Mathematics, 2020J. Jeba Jesintha +2 more
exaly +2 more sources
EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS
Advances in Mathematics: Scientific Journal, 2020A labeling of a graph $G$ with $\alpha$ vertices and $\beta$ edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum $\mod (2\gamma)$ of labels of edge incident on it, where $\gamma=max\{\alpha,\beta\}$ and the induced vertex labels are distinct. In
B. Ambika, G. Balasubramanian
openaire +1 more source
On Topological Graphic Passwords Made by Twin Edge Module-k Odd-Graceful Labelling
2018 2nd IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference (IMCEC), 2018Graphic password has been widely used in mobile devices and other fields, and it is facing a good opportunity for development since QR code is welcomed in the world. Here is a new graphical password (Topsnut-GPW) based on the idea of “topological structure plus number theory” and various labellings for solving network transfer delay by using other type
Xiaohui Zhang, Hui Sun, Bing Yao
openaire +1 more source
Edge-odd graceful labeling of Cartesian product of two paths
Journal of Information and Optimization SciencesLet G be a finite simple graph with p vertices and q edges is called an edge odd graceful labeling if there exists a bijective map f : E(G)→{1, 3, 5,,(2k − 1)} such that when each vertex is assigned, the sum of all edges incident to it mod 2k, where k = max(p, q), the resulting vertex labels are distinct.
D. Senthil Kumar, R. Anbarasan
openaire +1 more source
Edge-odd graceful labelings of prism-like graphs of cycles
A simple graph G with q edges is called an edge-odd graceful graph, if there is a bijection f from the edge set of the graph to {1,3,5,…,2q-1} such that, when each vertex is assigned the sum of all values of the edges incident to it modulo 2q, the resulting vertex labels are distinct.openaire +1 more source

