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

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

Found 2 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.
On topological integer additive set-labeling of star graphs Hafizh M. Radiapradana; Suhadi Wido Saputro; Erma Suwastika; Oki Neswan; Andrea Semanicova-Fenovcıkova
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 6, No 2 (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.2.13

Abstract

For integer k ≥ 2, let X = {0, 1, 2, …, k}. In this paper, we determine the order of a star graph K1, n of n + 1 vertices, such that K1, n admits a topological integer additive set-labeling (TIASL) with respect to a set X. We also give a condition for a star graph K1, n such that K1, n is not a TIASL-graph on set X.
Co-Authors Erma Suwastika Hafizh M. Radiapradana Kiki A. Sugeng Martin Baca Oki Neswan S Slamin Suhadi Wido Saputro