On entire face irregularity strength of disjoint union of plane graphs

Martin Bača, Marcela Lascsáková, Maria Naseem and Andrea Semaničová-Feňovčíková

Applied Mathematics and Computation, 2017, vol. 307, issue C, 232-238

Abstract: A face irregular entire k-labeling of a 2-connected plane graph G is a labeling of vertices, edges and faces of G with labels from the set {1,2,…,k} in such a way that for any two different faces their weights are distinct. The weight of a face under a k-labeling is the sum of labels carried by that face and all the edges and vertices incident with the face. The minimum k for which a plane graph G has a face irregular entire k-labeling is called the entire face irregularity strength.

Keywords: Irregular assignment; Irregularity strength; Face irregular entire labeling; Entire face irregularity strength (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317301625
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:307:y:2017:i:c:p:232-238

DOI: 10.1016/j.amc.2017.02.051

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().