טוען...
Monophonic pebbling number and t-pebbling number of some graphs
Assume G is a graph with some pebbles distributed over its vertices. A pebbling move is when two pebbles are removed from one vertex, one is thrown away, and the other is moved to an adjacent vertex. The monophonic pebbling number, [Formula: see text] of a connected graph G, is the least positive in...
שמור ב:
| Main Authors: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Taylor & Francis Group
2022-05-01
|
| סדרה: | AKCE International Journal of Graphs and Combinatorics |
| נושאים: | |
| גישה מקוונת: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2072789 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|