Results 31 to 40 of about 2,304,207 (332)
On Proper Labellings of Graphs with Minimum Label Sum [PDF]
Algorithmica, 2020 The 1-2-3 Conjecture states that every nice graph G (without component isomorphic to [Formula: see text]) admits a proper 3-labelling, i.e., a labelling of the edges with 1, 2, 3 such that no two adjacent vertices are incident to the same sum of labels.
Bensmail, Julien +2 more
openaire +6 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.
Jongmin Kim +3 more
semanticscholar +1 more source
On labeling in graph visualization [PDF]
Information Sciences, 2007 When visualizing graphs, it is essential to communicate the meaning of each graph object via text or graphical labels. Automatic placement of labels in a graph is an NP-Hard problem, for which efficient heuristic solutions have been recently developed.
Dogrusoz, U. +3 more
openaire +5 more sources
A Bibliometric Analysis of Graph Labeling Study Using VOSviewer
International Journal of Informatics, Information System and Computer Engineering, 2023 Graph labeling is a well-known theme of graph theory that involves an assignment of integers to the domain elements such as vertices or edges, or both, subject to certain conditions.
Yoong Kooi Kuan +3 more
doaj +1 more source
Journal of Function Spaces, 2022 Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +1 more source
Some New Results on Lucky Labeling
مجلة بغداد للعلوم, 2023 Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair ...
J. Ashwini +2 more
doaj +1 more source
Simulated Iterative Classification A New Learning Procedure for Graph Labeling
ECML/PKDD, 2009 Francis Maes +3 more
semanticscholar +2 more sources
--supermagic labeling of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a total labeling such that for every subgraph of isomorphic to , is constant. Additionally, the labeling is called - supermagic labeling if .
C. Chithra, G. Kumar, G. Marimuthu
openaire +3 more sources
A Dynamic Survey of Graph Labeling
Electronic Journal of Combinatorics, 2009 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 years over 200 graph labelings techniques have been studied in over
Joseph A. Gallian
semanticscholar +1 more source
Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling [PDF]
Conference on Empirical Methods in Natural Language Processing, 2017 Semantic role labeling (SRL) is the task of identifying the predicate-argument structure of a sentence. It is typically regarded as an important step in the standard NLP pipeline.
Diego Marcheggiani, Ivan Titov
semanticscholar +1 more source