Results 31 to 40 of about 2,693,458 (344)
Super Fibonacci Graceful Labeling [PDF]
Approaching topics such as Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful ...
Sridevi, R. +2 more
core +1 more source
Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling [PDF]
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
Solution of a Conjecture on Skolem Mean Graph [PDF]
A paper treating about Smarandachely super m-mean graph, skolem mean labeling, Skolem mean graph ...
Balaji, V.
core +1 more source
Neutrosophic Labeling Graph [PDF]
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 +1 more source
Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representation [PDF]
Credit card fraud incurs a considerable cost for both cardholders and issuing banks. Contemporary methods apply machine learning-based classifiers to detect fraudulent behavior from labeled transaction records.
Sheng Xiang +7 more
semanticscholar +1 more source
In this note, Schützenberger's notion of evacuation of Young tableaux [\textit{M. P. Schützenberger}, Math. Scand. 12, 117-128 (1963; Zbl 0216.302)] and of naturally labelled posets [\textit{M. P. Schützenberger}, Discrete Math. 2, 73-94 (1972; Zbl 0279.06001)] are extended to labelled graphs.
MALVENUTO, Claudia, REUTENAUER C.
openaire +2 more sources
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined by and all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling.
M Sree Vidya, S.S Sandhya
doaj +1 more source
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
core +1 more source
L(2,1)—labeling of the bracelet graph
In order to better study the channel assignment problem, a function from the vertex set to the set of all nonnegative integers is generated, that is the L(2,1)—labeling of a graph. Let the least label be zero, the L(2,1)—labeling number of a graph is the
Haiping LI, Ying YANG
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source

