Some open problems on graph labelings
TLDR
In this note, some of the open problems on various aspects of graph labelings which were posed by the participants during IWOGL 2009 and which have not been included in any of the other papers appearing in this volume are presented.About:
This article is published in AKCE International Journal of Graphs and Combinatorics.The article was published on 2009-01-01 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Graph (abstract data type) & Graceful labeling.read more
Citations
More filters
Book ChapterDOI
Edge-Magic Total Labelings
Alison Marr,Walter D. Wallis +1 more
TL;DR: An edge-magic total labeling on a graph G is a one-to-one map λ from V (G) \ cup E(G) onto the integers 1,2, …, v + e, where wt(xy) = k for any choice of edge xy.
Book ChapterDOI
Vertex-Magic Total Labelings
Alison Marr,Walter D. Wallis +1 more
TL;DR: A vertex-magic total labeling (VWC) as discussed by the authors is a one-to-one map of a graph from a vertex to the integers of the vertices of the graph, where the sum is over all vertices adjacent to the vertex x.
Journal ArticleDOI
Characterization of certain families of modular multiplicative divisor graphs
R. Revathi,S. Ganesh +1 more
TL;DR: A modular multiplicative divisor (MMD) labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices to a set of positive integers {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 28] such that the su...
Book ChapterDOI
Totally Magic Labelings
Alison Marr,Walter D. Wallis +1 more
TL;DR: In this article, the authors investigated the question: for a graph G does there exist a total labeling λ that is both edge-magic and vertex-magic, which is called a totally magic labeling and G is a completely magic graph.
Book ChapterDOI
Magic Type Labelings of Digraphs
Alison Marr,Walter D. Wallis +1 more
TL;DR: Agarwal et al. as discussed by the authors used graceful labelings on directed graphs and showed that they can be used for directed graph labeling, but not much work was done until the early 2000s when Marr worked with directed graph labelings in her dissertation.
References
More filters
Journal Article
A Dynamic Survey of Graph Labeling
TL;DR: In this survey I have collected everything I could find on graph labelings techniques that have appeared in journals that are not widely available.
Journal ArticleDOI
Magic valuations of finite graphs
Anton Kotzig,Alexander Rosa +1 more
TL;DR: In this article, the existence of magic valuations for complete graphs was investigated for graphs, which are related to cyclic decompositions of complete graphs into isomorphic subgraphs.
Journal ArticleDOI
Edge weights and vertex colours
TL;DR: In this paper, the edges of any non-trivial graph can be assigned weights from {1, 2, 3} so that adjacent vertices have different sums of incident edge weights.
Book ChapterDOI
How to number a graph
TL;DR: In this paper, the problem of numbering a graph is to assign integers to the nodes so as to achieve a given goal, i.e., to assign integer values to each node in a graph so that the number of nodes in the graph can be expressed as a function of the relationship between the nodes and the target nodes.