Results 1 to 10 of about 2,535,598 (350)
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening 50 years nearly 200 graph labelings techniques have been studied in over 2000 papers. Finding out what has been done for any particular kind of labeling and keeping up
J. Gallian
openaire +2 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
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
Shifted-Antimagic Labelings for Graphs [PDF]
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang +3 more
openaire +3 more sources
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
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
Stream-keys generation based on graph labeling for strengthening Vigenere encryption
This paper address the cryptographic keys management problem: how to generate the cryptographic keys and apply them to secure encryption. The purpose of this research was to study on utilizing graph labeling for generating stream-keys and implementing ...
A. C. Prihandoko +2 more
semanticscholar +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

