Results 61 to 70 of about 2,393,702 (209)
Graphs with degree complete labeling [PDF]
arXiv, 2017 In 2006 Qian [J. Qian, Degree complete graphs; Discrete Mathematics 306 (2006), 533--537] introduced the concept of degree complete graphs for labeled graphs. He also gave a characterization of these graphs in terms of two forbidden subgraphs. Furthermore, he mentioned that the property of being degree complete depends on the labeling of the graph ...
arxiv
GDM: Dual Mixup for Graph Classification with Limited Supervision [PDF]
arXiv, 2023 Graph Neural Networks (GNNs) require a large number of labeled graph samples to obtain good performance on the graph classification task. The performance of GNNs degrades significantly as the number of labeled graph samples decreases. To reduce the annotation cost, it is therefore important to develop graph augmentation methods that can generate new ...
arxiv
The Odd Harmonious Labeling on Variation of the Double Quadrilateral Windmill Graphs
Jurnal Ilmu Dasar, 2017 A Graphis calledif it hasvertices and edqes. The graphis said to be an odd harmonious if there exists an injectionsuch that induced mappingis a bijection and is said to be an odd harmonious labeling of.
Fery Firmansah
doaj +1 more source
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs [PDF]
arXiv, 2019 A coprime labeling of a graph of order $n$ is an assignment of distinct positive integer labels in which adjacent vertices have relatively prime labels. Restricting labels to only the set $1$ to $n$ results in a prime labeling. In this paper, we consider families of graphs in which a prime labeling cannot exist with the goal being to minimize the ...
arxiv
Improper Graceful and Odd-graceful Labellings of Graph Theory [PDF]
arXiv, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
arxiv
McKay ’ s Canonical Graph Labeling Algorithm
, 2008 The problem of deciding whether two graphs are isomorphic is fundamental in graph theory. Moreover, the flexibility with which other combinatorial objects can be modeled by graphs has meant that efficient programs for deciding whether graphs are ...
S. Hartke, A. J. Radcliffe
semanticscholar +1 more source
Super -edge antimagic total labeling of a subclass of trees
AKCE International Journal of Graphs and Combinatorics, 2017 A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj +1 more source
A note on distance labeling in planar graphs [PDF]
arXiv, 2016 A distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their labels and the labels are as short as possible. A major open problem is to determine the complexity of distance labeling in unweighted and undirected planar graphs.
arxiv
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +1 more source
Further results on edge even graceful labeling of the join of two graphs
Journal of the Egyptian Mathematical Society, 2020 In this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G=(V(G),E(G)) with p=|V(G)| vertices and q=|E(G)| edges if f:E(G)→{2,4,...,2q} is ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj +1 more source