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...
| Main Authors: | , , |
|---|---|
| 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 |
| Summary: | <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> |
|---|---|
| ISSN: | 2541-2205 |