Graphs with large Steiner number

UDC 519.1 In 2002, Gary Chartrand and Ping Zhang [The Steiner number of a graph, Discrete Math., 242, 41--54 (2002)] characterized the connected graphs $G$ of order $p \geq 3$ with Steiner number $p$, $p-1,$ or $2.$  In our paper, we characterize all connected graphs $G$ of...

Full description

Saved in:
Bibliographic Details
Date:2024
Main Authors: John, J., Raj, M. S. Malchijah
Format: Article
Language:English
Published: Institute of Mathematics, NAS of Ukraine 2024
Online Access:https://umj.imath.kiev.ua/index.php/umj/article/view/7409
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Ukrains’kyi Matematychnyi Zhurnal
Download file: Pdf

Institution

Ukrains’kyi Matematychnyi Zhurnal