Results 1 to 10 of about 2,422,838 (348)
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
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
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
GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks [PDF]
Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation.
Zemin Liu+3 more
semanticscholar +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory+3 more
doaj +1 more source
Novel classes of integers and their applications in graph labeling
Adding new classes of integers to literature is both challenging and charming. Until a new class is completely characterized, mathematics is never going to be worth it. While it's absurd to play with integers without intended consequences.
Shahbaz Ali, M. K. Mahmood, K. Shum
semanticscholar +1 more source