Results 11 to 20 of about 2,693,458 (344)
On H-irregular reflexive labeling of graph [PDF]
By an irregular reflexive labeling, we mean a function and such that if and if , where max . Let , the irregular reflexive labeling is called an -irregular reflexive -labeling of graph if every two different sub graphs and isomorphic to , it ...
Marsidi Marsidi +4 more
doaj +2 more sources
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
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
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
An Efficient Cryptosystem Using Playfair Cipher Together With Graph Labeling Techniques
Cryptography is the branch of Discrete Mathematics which deals with the transmission of secret communications between intended parties without the knowledge of third party.
B. Deepa, V. Maheswari, V. Balaji
semanticscholar +1 more source
Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +1 more source
ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH
Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo +2 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. Mahmood, K. Shum
semanticscholar +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 Antimagic Labeling for Some Families of Graphs
Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source

