Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Martin Baca
Department of Applied Mathematics and Informatics, Technical University, Letna 9, Kosice, Slovakia
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
On inclusive distance vertex irregular labelings Martin Baca; Andrea Semanicova-Fenovcikova; S. Slamin; Kiki A. Sugeng
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2018.6.1.5

Abstract

For a simple graph G, a vertex labeling f : V(G) → {1, 2, ..., k} is called a k-labeling. The weight of a vertex v, denoted by wtf(v) is the sum of all vertex labels of vertices in the closed neighborhood of the vertex v. A vertex k-labeling is defined to be an inclusive distance vertex irregular distance k-labeling of G if for every two different vertices u and v there is wtf(u) ≠ wtf(v). The minimum k for which the graph G has a vertex irregular distance k-labeling is called the inclusive distance vertex irregularity strength of G. In this paper we establish a lower bound of the inclusive distance vertex irregularity strength for any graph and determine the exact value of this parameter for several families of graphs.
Co-Authors Andrea Semanicova-Fenovcikova Kiki A. Sugeng S Slamin