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...

Full beskrivning

Bibliografiska uppgifter

Huvudupphov:	Hongfang Liu, Zhizhang Shen, Chenxu Yang, Kinkar Chandra Das
Materialtyp:	Artigo
Språk:	Inglês
Utgiven:	MDPI AG 2022-10-01
Serie:	Mathematics
Ämnen:	Steiner distance Steiner diameter line graph combinatorial thinking education networks
Länkar:	https://www.mdpi.com/2227-7390/10/20/3863
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!