Results 51 to 60 of about 2,422,838 (348)
Electronic Notes in Discrete Mathematics, 2017 This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
openaire +4 more sources
Succinct Representation of Labeled Graphs [PDF]
Algorithmica, 2007 In many applications, the properties of an object being modeled are stored as labels on vertices or edges of a graph. In this paper, we consider succinct representation of labeled graphs. Our main results are the succinct representations of labeled and multi-labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled ...
Barbay, Jérémy +3 more
openaire +5 more sources
Ratio Mathematica, 2023 In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
doaj +1 more source
Near-optimal adjacency labeling scheme for power-law graphs [PDF]
, 2015 An adjacency labeling scheme is a method that assigns labels to the vertices of a graph such that adjacency between vertices can be inferred directly from the assigned label, without using a centralized data structure.
Petersen, Casper +3 more
core +3 more sources
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
Minimal Sum Labeling of Graphs [PDF]
Journal of Discrete Algorithms, 2018 A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex $w\in V(G)$ such that $\ell(u)+\ell(v) = \ell(w)$. We say that sum labeling $\ell$ is minimal if there is a vertex
Matěj Konečný +5 more
openaire +3 more sources
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
Regular graphs of odd degree are antimagic [PDF]
, 2013 An antimagic labeling of a graph $G$ with $m$ edges is a bijection from $E(G)$ to $\{1,2,\ldots,m\}$ such that for all vertices $u$ and $v$, the sum of labels on edges incident to $u$ differs from that for edges incident to $v$.
Cranston, Daniel W.
core +1 more source
On the reflexive edge strength of the circulant graphs
AIMS Mathematics, 2021 A labeling of a graph is an assignment that carries some sets of graph elements into numbers (usually the non negative integers). The total k-labeling is an assignment fe from the edge set to the set {1,2,...,ke} and assignment fv from the vertex set to ...
Mohamed Basher
doaj +1 more source
On a labeling problem in graphs
Discrete Applied Mathematics, 2011 AbstractMotivated by applications in software programming, we consider the problem of covering a graph by a feasible labeling. Given an undirected graph G=(V,E), two positive integers k and t, and an alphabet Σ, a feasible labeling is defined as an assignment of a set Lv⊆Σ to each vertex v∈V, such that (i) |Lv|≤k for all v∈V and (ii) each label α∈Σ is ...
Mehmet Baysan +2 more
openaire +2 more sources