Article thumbnail

On (k, d)-Maximum Indexable Graphs and (k, d)-Maximum Arithmetic Graphs

By Zeynab Khoshbakht


Graph labelings where the vertices are assigned values subject to certain conditions are interesting problems and have been motivated by practical problems

Topics: Graph labeling, indexable graphs
Year: 2012
DOI identifier: 10.5281/zenodo.821496
OAI identifier:
Provided by: ZENODO
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles