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="math"><em>f</em>_<em>m</em>(<em>G</em>)</span> be a path with <span class="math"><em>m</em> ≥ 0</span> independent do...

Cijeli opis

Bibliografski detalji

Glavni autor:	Leomarich F Casinillo
Format:	Artigo
Jezik:	Inglês
Izdano:	Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2018-10-01
Serija:	Electronic Journal of Graph Theory and Applications
Teme:	fibonacci numbers, lucas numbers, fibonacci path domination, lucas path domination, independent domination
Online pristup:	http://www.ejgta.org/index.php/ejgta/article/view/333
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!