On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
In 1989, Chartrand, Oellermann, Tian and Zou introduced the Steiner distance for graphs. This is a natural generalization of the classical graph distance concept. Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mo>Γ</mo></semantics></math></inline-fo...
Сохранить в:
| Главные авторы: | , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
MDPI AG
2022-10-01
|
| Серии: | Mathematics |
| Предметы: | |
| Online-ссылка: | https://www.mdpi.com/2227-7390/10/20/3863 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|