The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori

文化大學機構典藏 CCUR > 商學院 > 資訊管理學系暨資訊管理研究所 > 期刊論文 > Item 987654321/21097

請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/21097

題名:	The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori
作者:	Wang, FH (Wang, Fu-Hsing)
貢獻者:	資管系
關鍵詞:	geodetic number forcing geodetic number complete n-partite graphs meshes tori
日期:	2010
上傳時間:	2011-12-15 13:57:09 (UTC+8)
摘要:	A vertex set D in a graph G is called a geodetic set if each vertex of G is lying on some shortest u-v path of G, where u, v is an element of D. The geodetic number of a graph G is the minimum cardinality among all geodetic sets. A subset S of a geodetic set D is called a forcing subset of D if D is the unique geodetic set containing S. The forcing geodetic number of D is the minimum cardinality of a forcing subset of D, and the lower and the upper forcing geodetic numbers of a graph G are the minimum and the maximum forcing geodetic numbers, respectively, among all minimum geodetic sets of G. In this article, we find out the geodetic numbers, the lower and the upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori.
顯示於類別:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

在CCUR中所有的資料項目都受到原著作權保護.