Exclusive graphs: a new link among labelings

<p>In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and...

Full description

Bibliographic Details
Main Authors: Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima
Format: Article
Language:English
Published: InaCombS; Universitas Jember; dan Universitas Indonesia 2019-06-01
Series:Indonesian Journal of Combinatorics
Subjects:
Online Access:http://www.ijc.or.id/index.php/ijc/article/view/77
_version_ 1818599882931306496
author Rikio Ichishima
Francesc A. Muntaner-Batle
Akito Oshima
author_facet Rikio Ichishima
Francesc A. Muntaner-Batle
Akito Oshima
author_sort Rikio Ichishima
collection DOAJ
description <p>In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and an upper-exclusive one results in a strongly felicitous graph. We also introduce the concept of decompositional graphs. By means of this, we provide some results involving the cartesian products of exclusive graphs.</p>
first_indexed 2024-12-16T12:26:40Z
format Article
id doaj.art-200e2b20074e427f8e248a29e1d522ba
institution Directory Open Access Journal
issn 2541-2205
language English
last_indexed 2024-12-16T12:26:40Z
publishDate 2019-06-01
publisher InaCombS; Universitas Jember; dan Universitas Indonesia
record_format Article
series Indonesian Journal of Combinatorics
spelling doaj.art-200e2b20074e427f8e248a29e1d522ba2022-12-21T22:31:49ZengInaCombS; Universitas Jember; dan Universitas IndonesiaIndonesian Journal of Combinatorics2541-22052019-06-013111310.19184/ijc.2019.3.1.126Exclusive graphs: a new link among labelingsRikio Ichishima0Francesc A. Muntaner-Batle1Akito Oshima2Kokushikan UniversityThe University of NewcastleThe University of Newcastle<p>In this paper, we define a strongly felicitous graph to be lower-exclusive, upper-exclusive and exclusive depending on different restrictions for the vertex labels. With these new concepts, we show that the union of finite collection of strongly felicitous graphs, a lower-exclusive one and an upper-exclusive one results in a strongly felicitous graph. We also introduce the concept of decompositional graphs. By means of this, we provide some results involving the cartesian products of exclusive graphs.</p>http://www.ijc.or.id/index.php/ijc/article/view/77exclusive graph(strongly) felicitous graphdecompositional
spellingShingle Rikio Ichishima
Francesc A. Muntaner-Batle
Akito Oshima
Exclusive graphs: a new link among labelings
Indonesian Journal of Combinatorics
exclusive graph
(strongly) felicitous graph
decompositional
title Exclusive graphs: a new link among labelings
title_full Exclusive graphs: a new link among labelings
title_fullStr Exclusive graphs: a new link among labelings
title_full_unstemmed Exclusive graphs: a new link among labelings
title_short Exclusive graphs: a new link among labelings
title_sort exclusive graphs a new link among labelings
topic exclusive graph
(strongly) felicitous graph
decompositional
url http://www.ijc.or.id/index.php/ijc/article/view/77
work_keys_str_mv AT rikioichishima exclusivegraphsanewlinkamonglabelings
AT francescamuntanerbatle exclusivegraphsanewlinkamonglabelings
AT akitooshima exclusivegraphsanewlinkamonglabelings