A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the late 1960s. In the intervening years dozens of graph labelings techniques have been studied in over 1000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.

/pdf/a-dynamic-survey-of-graph-labeling-198znmwxtq.pdf

A Dynamic Survey of Graph Labeling

On irregular total labellings

Strongly indexable graphs

On anti-magic labeling for graph products

This paper is mainly devoted to generate (special)(super) 
edge-magic labelings of graphs using matrices. Matrices are used 
in order to find lower bounds for the number of non-isomorphic 
(special)(super) edge-magic labelings of certain types of graphs. 
Also new applications of graph labelings are discussed.

Labeling Generating Matrices

A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1;2;:::;p so that the values on the edges, obtained as the product of the labels of their end vertices, are all distinct In this paper, we study structural properties of strongly multiplicative graphs We show that all graphs in some classes, including all trees, are strongly multiplicative, and consider the question of the maximum number of edges in a strongly multiplicative graph of a given order

Strongly multiplicative graphs

Arithmetic graphs

A set coloring of the graph G is an assignment (function) of distinct subsets of a finite set X of colors to the vertices of the graph, where the colors of the edges are obtained as the symmetric differences of the sets assigned to their end vertices which are also distinct. A set coloring is called a strong set coloring if sets on the vertices and edges are distinct and together form the set of all nonempty subsets of X. A set coloring is called a proper set coloring if all the nonempty subsets of X are obtained on the edges. A graph is called strongly set colorable (properly set colorable) if it admits a strong set coloring (proper set coloring).

In this paper we give some necessary conditions for a graph to admit a strong set coloring (a proper set coloring), characterize strongly set colorable complete bipartite graphs and strongly (properly) set colorable complete graphs, etc. Also, we give a construction of a planar strongly set colorable graph from a planar graph, a strongly set colorable tree from a tree and a properly set colorable tree from a tree, etc., thereby showing their embeddings.

Set colorings of graphs

On graceful trees.

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

S. M. Hegde

Author Tools

Chat about Author