Results 1 to 10 of about 2,693,458 (344)
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 +2 more sources
Electronic Notes in Discrete Mathematics, 2016 We propose the study of many new variants of two-person graph labeling games. Hardly anything has been done in this wide open field so far.
Z. Tuza
semanticscholar +5 more sources
Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography [PDF]
Jambura Journal of Mathematics, 2021 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 +3 more sources
Bounds on the number of isolates in sum graph labeling
Discrete Mathematics, 2001 A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with label L(w )= L(u )+ L(v). The sum
Hiroshi Nagamochi, Mirka Miller
exaly +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
Multi-scale context for scene labeling via flexible segmentation graph
Pattern Recognition, 2016 Longin Jan Latecki +2 more
exaly +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
Polygonal Graceful Labeling of Some Simple Graphs
Ratio Mathematica, 2022 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
Stream-keys generation based on graph labeling for strengthening Vigenere encryption
International Journal of Electrical and Computer Engineering (IJECE), 2022 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
Dispersed graph labellings [PDF]
Australas. J Comb., 2023 A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a $k$-dispersed labelling. In this paper, we study upper and lower bounds on $DL(G)$.
William J. Martin, Douglas R. Stinson
openaire +3 more sources