Results 11 to 20 of about 2,304,207 (332)
This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
Z. Tuza
semanticscholar +6 more sources
Neutrosophic Labeling Graph [PDF]
In this paper, some new connectivity concepts in neutrosophic labeling graphs are portrayed. Definition of neutrosophic strong arc, neutrosophic partial cut node, Neutrosophic Bridge and block are introduced with examples.
M. Gomathi, V. Keerthika
doaj +2 more sources
Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph
A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with
Juan L. G. Guirao +3 more
doaj +2 more sources
A region-level graph labeling approach to motion-based segmentation
M. Gelgon, P. Bouthemy
semanticscholar +3 more sources
Informative pseudo-labeling for graph neural networks with few labels [PDF]
Graph neural networks (GNNs) have achieved state-of-the-art results for semi-supervised node classification on graphs. Nevertheless, the challenge of how to effectively learn GNNs with very few labels is still under-explored. As one of the prevalent semi-
Yayong Li, Jie Yin, Ling Chen
semanticscholar +1 more source
GLaRA: Graph-based Labeling Rule Augmentation for Weakly Supervised Named Entity Recognition [PDF]
Instead of using expensive manual annotations, researchers have proposed to train named entity recognition (NER) systems using heuristic labeling rules.
Xinyan Zhao, Haibo Ding, Z. Feng
semanticscholar +1 more source
Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu +2 more
doaj +1 more source
Polygonal Graceful Labeling of Some Simple Graphs
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source
An Algorithmic Approach for Encryption using Graph Labeling
In the recent computerized world, cryptography plays an important role so as to transfer information safely between at least two substances. Cryptography consists of two parts, one is encryption of the message so that the cypher text will not reveal the ...
P. Amudha, J. Jayapriya, J. Gowri
semanticscholar +1 more source
An Efficient Cryptosystem Using Playfair Cipher Together With Graph Labeling Techniques
Cryptography is the branch of Discrete Mathematics which deals with the transmission of secret communications between intended parties without the knowledge of third party.
B. Deepa, V. Maheswari, V. Balaji
semanticscholar +1 more source

