Results 51 to 60 of about 2,535,598 (350)
GPT-GNN: Generative Pre-Training of Graph Neural Networks [PDF]
Knowledge Discovery and Data Mining, 2020 Graph neural networks (GNNs) have been demonstrated to be powerful in modeling graph-structured data. However, training GNNs requires abundant task-specific labeled data, which is often arduously expensive to obtain.
Ziniu Hu +4 more
semanticscholar +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
The Odd Harmonious Labeling of Layered Graphs
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Graphs that have the properties of odd harmonious labeling are odd harmonious graphs. The research objective of this paper is to obtain odd harmonious labeling on layered graph C(x,y) and layered graph D(x,y).
Fery Firmansah
doaj +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources
Sublinear Distance Labeling [PDF]
, 2016 A distance labeling scheme labels the $n$ nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels.
Alstrup, Stephen +3 more
core +3 more sources
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 more sources
, 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)$.
Martin, William J., Stinson, Douglas R.
openaire +3 more sources
, 2011 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
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source