Skip to main content
Log in

A Note on Labeling of Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

 A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper, we study some classes of graphs and their corresponding labelings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: May 12, 1995 / Revised: April 19, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Suresh Singh, G. A Note on Labeling of Graphs. Graphs Comb 14, 201–207 (1998). https://doi.org/10.1007/s003730050026

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050026

Navigation