INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
Find Labeling Numbers Of All Powers Of Paths Using An Interval Graph G
Authors Name:
Tata Sivaiah
, Dr. A. Sudhakaraiah , R. Joshna Priyadarshini , P. Obulesh
Unique Id:
IJSDR2012009
Published In:
Volume 5 Issue 12, December-2020
Abstract:
One of the principal topics in graph theory is labeling or coloring of graph. Graph labeling is motivated by the problems like, task assignment, traffic phasing, frequency assignment in radio communications, fleet maintenance. In this paper we have studied a generalization of optimal vertex coloring or labeling problem, namely L (h1, h2, . . . , hm)-labeling of graphs, which is also a generalization of L(h,k)labeling problem. Large amounts of work have been done for various classes of graphs. For various values of h1, h2, . . . , hm different problems have been addressed by the researchers. Motivated by these, we investigated the L (h1, h2, . . . , hm)labeling of all powers of paths using an interval graph G.
Keywords:
Path, Power of Path, Interval Family, Interval Graph, Labeling Number
Cite Article:
"Find Labeling Numbers Of All Powers Of Paths Using An Interval Graph G", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.5, Issue 12, page no.44 - 70, December-2020, Available :http://www.ijsdr.org/papers/IJSDR2012009.pdf
Downloads:
000337357
Publication Details:
Published Paper ID: IJSDR2012009
Registration ID:192753
Published In: Volume 5 Issue 12, December-2020
DOI (Digital Object Identifier):
Page No: 44 - 70
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn