Results 51 to 60 of about 2,525,419 (350)
Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shift [PDF]
The Web Conference, 2022 Graph Convolutional Networks (GCNs) have recently attracted vast interest and achieved state-of-the-art performance on graphs, but its success could typically hinge on careful training with amounts of expensive and time-consuming labeled data.
Hongrui Liu +5 more
semanticscholar +1 more source
On the edge irregularity strength of grid graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of .
I. Tarawneh, R. Hasni, A. Ahmad
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
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing
Transportation Science, 2020 We consider the shortest path problem with resource constraints arising as a subproblem in state-of-the-art branch-cut-and-price algorithms for vehicle routing problems.
R. Sadykov, Eduardo Uchoa, A. Pessoa
semanticscholar +1 more source
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
Note on group distance magic graphs $G[C_4]$ [PDF]
, 2012 A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$
D. Froncek +3 more
core +2 more sources
Enumeration Of Labelled Graphs [PDF]
Canadian Journal of Mathematics, 1956 1. Introduction. The number of connected linear graphs having V vertices labelled 1, … , V and λ (unlabelled) lines is found below. Similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines.
openaire +2 more sources
On the Implicit Graph Conjecture [PDF]
, 2016 The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder.
Chandoo, Maurice
core +3 more sources
Parallelism Detection Using Graph Labelling
Lobachevskii Journal of Mathematics, 2022 Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing parallel programs include parallel languages and libraries as well as parallelizing compilers and convertors that can perform automatic parallelization. The basic approach for parallelism detection is analysis of data dependencies and properties of program
Telegin, P. N. +3 more
openaire +2 more sources
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