Irregular labelings of circulant graphs

Marcin Anholcer; Cory Palmer

doi:10.1016/j.disc.2012.06.017

Irregular labelings of circulant graphs

Marcin Anholcer, Cory Palmer

Mathematical Sciences

Poznan University of Economics and Business

Research output: Contribution to journal › Article › peer-review

47 Scopus citations

Abstract

We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cⁱⁿ(1,2,⋯, k) and prove that tvs(Cⁱⁿ(1,2,⋯,k))=n+2k/2k+1⌉, while s(Cⁱⁿ(1,2,⋯,k))=n+2k-1/2k⌉ except if either n=2k+1 or if k is odd and n≡2k+1(mod4k), then s(Cⁱⁿ(1,2,⋯,k))=n+2k- 12k⌉+1.

Original language	English
Pages (from-to)	3461-3466
Number of pages	6
Journal	Discrete Mathematics
Volume	312
Issue number	23
DOIs	https://doi.org/10.1016/j.disc.2012.06.017
State	Published - Dec 6 2012

Keywords

Circulant graph
Graph labeling
Graph weighting
Irregularity strength
Total vertex irregularity strength

Access to Document

10.1016/j.disc.2012.06.017

Cite this

@article{4394a4ec802d441288af8241ab62c27d,

title = "Irregular labelings of circulant graphs",

abstract = "We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,⋯, k) and prove that tvs(Cin(1,2,⋯,k))=n+2k/2k+1⌉, while s(Cin(1,2,⋯,k))=n+2k-1/2k⌉ except if either n=2k+1 or if k is odd and n≡2k+1(mod4k), then s(Cin(1,2,⋯,k))=n+2k- 12k⌉+1.",

keywords = "Circulant graph, Graph labeling, Graph weighting, Irregularity strength, Total vertex irregularity strength",

author = "Marcin Anholcer and Cory Palmer",

year = "2012",

month = dec,

day = "6",

doi = "10.1016/j.disc.2012.06.017",

language = "English",

volume = "312",

pages = "3461--3466",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "23",

}

TY - JOUR

T1 - Irregular labelings of circulant graphs

AU - Anholcer, Marcin

AU - Palmer, Cory

PY - 2012/12/6

Y1 - 2012/12/6

N2 - We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,⋯, k) and prove that tvs(Cin(1,2,⋯,k))=n+2k/2k+1⌉, while s(Cin(1,2,⋯,k))=n+2k-1/2k⌉ except if either n=2k+1 or if k is odd and n≡2k+1(mod4k), then s(Cin(1,2,⋯,k))=n+2k- 12k⌉+1.

AB - We investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,⋯, k) and prove that tvs(Cin(1,2,⋯,k))=n+2k/2k+1⌉, while s(Cin(1,2,⋯,k))=n+2k-1/2k⌉ except if either n=2k+1 or if k is odd and n≡2k+1(mod4k), then s(Cin(1,2,⋯,k))=n+2k- 12k⌉+1.

KW - Circulant graph

KW - Graph labeling

KW - Graph weighting

KW - Irregularity strength

KW - Total vertex irregularity strength

UR - https://www.scopus.com/pages/publications/84866899969

U2 - 10.1016/j.disc.2012.06.017

DO - 10.1016/j.disc.2012.06.017

M3 - Article

AN - SCOPUS:84866899969

SN - 0012-365X

VL - 312

SP - 3461

EP - 3466

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 23

ER -

Irregular labelings of circulant graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this