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...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |