A note on Fibonacci and Lucas number of domination in path
Let G = (V(G), E(G)) be a path of order n ≥ 1. Let fm(G) be a path with m ≥ 0 independent dominating vertices which follows a Fibonacci string of binary numbers where 1 is the dominating vertex. A set F(G) contains all possible fm(G), m ≥ 0, having the cardinality of the Fibonacci number Fn + 2. Let...
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | |
| Natura: | EJournal Article |
| Pubblicazione: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
| Soggetti: | |
| Accesso online: | Get Fulltext |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
Accesso online
Get Fulltext3rd Floor Main Library
| Collocazione: |
A1234.567 |
|---|---|
| Copia 1 | Disponibile |