A note on Fibonacci and Lucas number of domination in path

A note on Fibonacci and Lucas number of domination in path

<p>Let <span class="math"><em>G</em> = (<em>V</em>(<em>G</em>), <em>E</em>(<em>G</em>))</span> be a path of order <span class="math"><em>n</em> ≥ 1</span>. Let <span class=&qu...

Full description

Bibliographic Details
Main Author: Leomarich F Casinillo
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
fibonacci numbers, lucas numbers, fibonacci path domination, lucas path domination, independent domination
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/333

Internet

https://www.ejgta.org/index.php/ejgta/article/view/333

Similar Items