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><sub><em>m</em></sub>(<em>G</em>)</span> be a path with <span class="math"><em>m</em> ≥ 0</span> independent do...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-10-01
|
| Серии: | Electronic Journal of Graph Theory and Applications |
| Предметы: | |
| Online-ссылка: | http://www.ejgta.org/index.php/ejgta/article/view/333 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|