A Note on n-Set Distance-Labelings of Graphs - Open Journal of Discrete Mathematics

OJDM > Vol.11 No.3, July 2021

Open Journal of Discrete Mathematics

Volume 11, Issue 3 (July 2021)

ISSN Print: 2161-7635 ISSN Online: 2161-7643

Google-based Impact Factor: 0.64 Citations

A Note on n-Set Distance-Labelings of Graphs ()

HTML XML

Download as PDF (Size: 311KB) PP. 55-60

DOI: 10.4236/ojdm.2021.113005 222 Downloads 768 Views Citations

Author(s)

Roger K. Yeh

Affiliation(s)

Department of Applied Mathematics, Feng Chia University, Taichung City.

ABSTRACT

This note is considered as a sequel of Yeh [1]. Here, we present a generalized (vertex) distance labeling (labeling vertices under constraints depending the on distance between vertices) of a graph. Instead of assigning a number (label) to each vertex, we assign a set of numbers to each vertex under given conditions. Some basic results are given in the first part of the note. Then we study a particular class of this type of labelings on several classes of graphs.

KEYWORDS

Graph Distance Labeling

Share and Cite:

Yeh, R. (2021) A Note on n-Set Distance-Labelings of Graphs. Open Journal of Discrete Mathematics, 11, 55-60. doi: 10.4236/ojdm.2021.113005.

Cited by

[1]	Some New Classes of (k, d) Graceful 3 Distance Trees and 3 Distance Unicyclic Graphs
	Indian Journal …, 2022

[2]	N-Set Distance-Labelings for Cycle Graphs
	Open Journal of Discrete Mathematics, 2022

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies