Results 21 to 30 of about 2,422,838 (348)
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
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
Barekeng, 2022 Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non ...
Ahmad Lasim +2 more
doaj +1 more source
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
Simulated Iterative Classification A New Learning Procedure for Graph Labeling
ECML/PKDD, 2009 Francis Maes +3 more
semanticscholar +2 more sources
Good edge-labelling of graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 AbstractA good edge-labelling of a graph G is a labelling of its edges such that, for any ordered pair of vertices (x,y), there do not exist two paths from x to y with increasing labels. This notion was introduced by Bermond et al. (2009) [2] to solve wavelength assignment problems for specific categories of graphs.
Araujo, Julio +3 more
openaire +6 more sources
Radio labelings of distance graphs [PDF]
Discrete Applied Mathematics, 2013 A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| \geq k+1 - d(x,y),$$ for any two vertices $x$ and $y$, $x\ne y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio labelings of distance graphs, i.e., graphs with the set $\Z$
Čada, Roman +3 more
openaire +4 more sources
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
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
Note on the Labelled tree graphs [PDF]
Journal of High Energy Physics, 2020 Abstract In the CHY-frame for the tree-level amplitudes, the bi-adjoint scalar theory has played a fundamental role because it gives the on-shell Feynman diagrams for all other theories. Recently, an interesting generalization of the bi-adjoint scalar theory has been given in [1] by the “Labelled tree graphs”, which carries a lot ...
Feng, Bo, Zhang, Yaobo
openaire +4 more sources