On the Minimum Span of Cone, Tadpole, and Barbell Graphs
Authors
Hafif Komarullah, Ikhsanul Halikin*, Kiswara Agung Santoso
Graph, Combinatorics, and Algebra Research Group, Department of Mathematics, FMIPA, University of Jember
*Corresponding author. Email: ikhsan.fmipa@unej.ac.id
Corresponding Author
Ikhsanul Halikin
Available Online 8 February 2022.
- DOI
- 10.2991/acsr.k.220202.009How to use a DOI?
- Keywords
- L(2,1)-labelling; Minimum of span; Cone; Tadpole; Barbell graphs
- Abstract
Let G be a simple and connected graph with p vertices and q edges. An L(2,1)-labelling on the graph G is a function f: V(G) → {0,1, …, k} such that every two vertices with a distance one receive labels that differ by at least two, and every two vertices at distance two receive labels that differ by at least one. A number k is called as span of L(2.1)-labelling, if k is the largest vertex labels. The span of a graph G can be more than one, the minimum value of the span of a graph G is notated by λ(2,1) (G). In this paper, we determine the minimum span of cone, tadpole, and barbell graphs
- Copyright
- © 2022 The Authors. Published by Atlantis Press International B.V.
- Open Access
- This is an open access article under the CC BY-NC license.
Cite this article
TY - CONF AU - Hafif Komarullah AU - Ikhsanul Halikin AU - Kiswara Agung Santoso PY - 2022 DA - 2022/02/08 TI - On the Minimum Span of Cone, Tadpole, and Barbell Graphs BT - Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021) PB - Atlantis Press SP - 40 EP - 43 SN - 2352-538X UR - https://doi.org/10.2991/acsr.k.220202.009 DO - 10.2991/acsr.k.220202.009 ID - Komarullah2022 ER -