Results 61 to 70 of about 2,286 (90)
HyMSS-GAD: a hybrid multi-stage framework for multi-view graph anomaly detection with structural, contextual, and geometric reasoning. [PDF]
Sci RepKhan W, Ebrahim N, Elloumi M, Brahim K.
europepmc +1 more source
On growth and form of animal behavior. [PDF]
Front Integr NeurosciGolani I, Kafkafi N.
europepmc +1 more source
Decomposition of Complete Graphs and Complete Bipartite Graphs Into Copies of Pn3 or S2pn3 and Harmonious Labeling of K2+ Pn [PDF]
, 2011 Selvaraju, P. (P), Sethuraman, G. (G)
core
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 +2 more sources
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 +2 more sources
Edge-odd graceful labelings of prism-like graphs of cycles
, 2015 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.
Apinya Tirasuwanwasee +2 more
openaire +2 more sources
Edge-Odd Graceful Labelings of some prisms and some Prism-Like Graph
, 2013 A simple graph G with q edges called an edge-odd graceful graph if there is a bijection if from the edge set of the graph to the set 1, 3, 5,0…,2q-1 such that, when each vertex is assigned the sum of all values of the edges incident to it modulo 2q.
Akkaporn Wongpradit +2 more
openaire +2 more sources