Results 11 to 20 of about 2,525,419 (350)
The Electronic Journal of Combinatorics, 2018 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
J. Gallian
semanticscholar +2 more sources
Edge-labeling Graph Neural Network for Few-shot Learning [PDF]
Computer Vision and Pattern Recognition, 2019 In this paper, we propose a novel edge-labeling graph neural network (EGNN), which adapts a deep neural network on the edge-labeling graph, for few-shot learning.
Kim, Jongmin +3 more
core +2 more sources
Universal Communication, Universal Graphs, and Graph Labeling [PDF]
Information Technology Convergence and Services, 2019 We introduce a communication model called universal SMP, in which Alice and Bob receive a function f belonging to a family ?, and inputs x and y. Alice and Bob use shared randomness to send a message to a third party who cannot see f, x, y, or the shared
Harms, Nathaniel
core +3 more sources
Harmonic Labeling of Graphs [PDF]
Discrete Mathematics, 2010 Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid.
Benjamini, Itai +3 more
core +2 more sources
Neutrosophic Labeling Graph [PDF]
Neutrosophic Sets and Systems, 2019 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
Mathematics, 2018 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
An application on edge irregular reflexive labeling for $ m^t $-graph of cycle graph
AIMS MathematicsGraph labeling is an increasingly popular problem in graph theory. A mapping converts a collection of graph components into a set of integers known as labels.
Muhammad Amir Asif +5 more
doaj +2 more sources
Informative pseudo-labeling for graph neural networks with few labels [PDF]
Data mining and knowledge discovery, 2022 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]
Conference of the European Chapter of the Association for Computational Linguistics, 2021 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
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 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