Labeling cacti with a condition at distance two

<p class="MsoNormal" style="TEXT-ALIGN: justify; TEXT-INDENT: 0.5in; MARGIN: 0in 0in 0pt; mso-layout-grid-align: none"> </p><span style="font-size: small;"><span style="font-family: Times New Roman;"><p class="MsoNormal" st...

Full description

Bibliographic Details
Main Authors: S. K. Vaidya, D. D. Bantva
Format: Article
Language:English
Published: Università degli Studi di Catania 2011-06-01
Series:Le Matematiche
Subjects:
Online Access:http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/775
id doaj-3dc5542f4c7b4b83b4c05db0f32085ae
record_format Article
spelling doaj-3dc5542f4c7b4b83b4c05db0f32085ae2020-11-25T03:52:12ZengUniversità degli Studi di CataniaLe Matematiche0373-35052037-52982011-06-016612734773Labeling cacti with a condition at distance twoS. K. Vaidya0D. D. Bantva1Saurashtra UniversityAtmiya Institute of Technology and Science, Rajkot - 360 005<p class="MsoNormal" style="TEXT-ALIGN: justify; TEXT-INDENT: 0.5in; MARGIN: 0in 0in 0pt; mso-layout-grid-align: none"> </p><span style="font-size: small;"><span style="font-family: Times New Roman;"><p class="MsoNormal" style="text-align: justify; margin: 0in 0in 0pt; mso-layout-grid-align: none;">An <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling of a graph <em style="mso-bidi-font-style: normal;">G</em> is a function <em style="mso-bidi-font-style: normal;">f</em> <span style="mso-spacerun: yes;"> </span>from the vertex set <em style="mso-bidi-font-style: normal;">V(G)</em> to the set of all nonnegative integers such that | <em style="mso-bidi-font-style: normal;">f (x)</em><em style="mso-bidi-font-style: normal;"><span style="font-family: Arial; mso-bidi-font-family: 'Times New Roman';">-</span> f (y)</em>| ≥ 2 if <em style="mso-bidi-font-style: normal;">d(x, y)</em> = 1 and | <em style="mso-bidi-font-style: normal;">f (x) - f (y)|</em> ≥ 1 if <em style="mso-bidi-font-style: normal;">d(x, y)</em> = 2. The <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling number <em style="mso-bidi-font-style: normal;">λ(G)</em> of <em style="mso-bidi-font-style: normal;">G</em> is the smallest number <em style="mso-bidi-font-style: normal;">k</em> such that <em style="mso-bidi-font-style: normal;">G</em> has an <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling with max{<em style="mso-bidi-font-style: normal;">f (v) : v </em><span style="font-family: Symbol; mso-bidi-font-family: Symbol;">Î</span><em style="mso-bidi-font-style: normal;"> V(G)</em>} = <em style="mso-bidi-font-style: normal;">k</em>. In this paper we present a graph family which has λ-number Δ+1 or Δ+2.</p></span></span>http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/775L(2,1)-labeling, λ-number, Cactus graph, Block cut point graph, One point union of cycles
collection DOAJ
language English
format Article
sources DOAJ
author S. K. Vaidya
D. D. Bantva
spellingShingle S. K. Vaidya
D. D. Bantva
Labeling cacti with a condition at distance two
Le Matematiche
L(2,1)-labeling, λ-number, Cactus graph, Block cut point graph, One point union of cycles
author_facet S. K. Vaidya
D. D. Bantva
author_sort S. K. Vaidya
title Labeling cacti with a condition at distance two
title_short Labeling cacti with a condition at distance two
title_full Labeling cacti with a condition at distance two
title_fullStr Labeling cacti with a condition at distance two
title_full_unstemmed Labeling cacti with a condition at distance two
title_sort labeling cacti with a condition at distance two
publisher Università degli Studi di Catania
series Le Matematiche
issn 0373-3505
2037-5298
publishDate 2011-06-01
description <p class="MsoNormal" style="TEXT-ALIGN: justify; TEXT-INDENT: 0.5in; MARGIN: 0in 0in 0pt; mso-layout-grid-align: none"> </p><span style="font-size: small;"><span style="font-family: Times New Roman;"><p class="MsoNormal" style="text-align: justify; margin: 0in 0in 0pt; mso-layout-grid-align: none;">An <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling of a graph <em style="mso-bidi-font-style: normal;">G</em> is a function <em style="mso-bidi-font-style: normal;">f</em> <span style="mso-spacerun: yes;"> </span>from the vertex set <em style="mso-bidi-font-style: normal;">V(G)</em> to the set of all nonnegative integers such that | <em style="mso-bidi-font-style: normal;">f (x)</em><em style="mso-bidi-font-style: normal;"><span style="font-family: Arial; mso-bidi-font-family: 'Times New Roman';">-</span> f (y)</em>| ≥ 2 if <em style="mso-bidi-font-style: normal;">d(x, y)</em> = 1 and | <em style="mso-bidi-font-style: normal;">f (x) - f (y)|</em> ≥ 1 if <em style="mso-bidi-font-style: normal;">d(x, y)</em> = 2. The <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling number <em style="mso-bidi-font-style: normal;">λ(G)</em> of <em style="mso-bidi-font-style: normal;">G</em> is the smallest number <em style="mso-bidi-font-style: normal;">k</em> such that <em style="mso-bidi-font-style: normal;">G</em> has an <em style="mso-bidi-font-style: normal;">L(2,1)</em>-labeling with max{<em style="mso-bidi-font-style: normal;">f (v) : v </em><span style="font-family: Symbol; mso-bidi-font-family: Symbol;">Î</span><em style="mso-bidi-font-style: normal;"> V(G)</em>} = <em style="mso-bidi-font-style: normal;">k</em>. In this paper we present a graph family which has λ-number Δ+1 or Δ+2.</p></span></span>
topic L(2,1)-labeling, λ-number, Cactus graph, Block cut point graph, One point union of cycles
url http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/775
work_keys_str_mv AT skvaidya labelingcactiwithaconditionatdistancetwo
AT ddbantva labelingcactiwithaconditionatdistancetwo
_version_ 1724483759244312576