On topological integer additive set-labeling of star graphs

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 T...

Full description

Saved in:
Bibliographic Details
Published inElectronic journal of graph theory and applications Vol. 6; no. 2; pp. 341 - 346
Main Authors Radiapradana, Hafizh M., Saputro, Suhadi Wido, Suwastika, Erma, Neswan, Oki, Semanicova-Fenovcikova, Andrea
Format Journal Article
LanguageEnglish
Published Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 01.01.2018
Subjects
set-labeling, set topology, star graph, sumset, topological integer additive set-labeling
Online AccessGet full text

Cover

More Information
Summary: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 .
ISSN:2338-2287
2338-2287
DOI:10.5614/ejgta.2018.6.2.13