Results 81 to 90 of about 1,270,493 (107)

Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs

open access: yesIndian Journal of Industrial and Applied Mathematics
AbstractAn edge odd graceful labeling of graph G with p vertices and q edges is a modular technique of edge labeling, introduced bySolairaju and Chithra in 2008 [9]. It is a bijection f from the edge set E(G) of the graph to {1, 3,…, 2q - 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex ...
K Valani Darshana, K Kanani Kailas
openaire   +2 more sources

Some Cartesian Products of a Path and Prism Related Graphs That Are Edge Odd Graceful [PDF]

open access: yesJournal of Fundamental Mathematics and Applications (JFMA), 2021
Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its order and its size. Let $f$ be a bijective edge labeling which codomain is the set of odd integers from 1 up to $2q-1$.
Aluysius Sutjijana   +2 more
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Edge Odd Graceful Labeling of Some Special Graphs

International Journal of Mathematics Trends and Technology, 2018
K Thiagarajan
exaly   +2 more sources

Edge Even Graceful Labeling of Polar Grid Graphs

open access: yesSymmetry, 2019
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set { 2 , 4 ...
Salama Nagy Daoud
exaly   +2 more sources

EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

Advances in Mathematics: Scientific Journal, 2020
A 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), 2018
Graphic 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 Even Graceful Labeling of Cylinder Grid Graph

open access: yesSymmetry, 2019
Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G = ( V ( G ) , E ( G ) ) of order P = | ( V ( G ) | and size
Salama Nagy Daoud
exaly   +2 more sources

Edge-odd graceful labeling of Cartesian product of two paths

Journal of Information and Optimization Sciences
Let 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

Home - About - Disclaimer - Privacy