The lower and upper forcing geodetic numbers of block–cactus graphs

CCUR > College of Business > Department of Information Management & Graduate Institute of Information Management > periodical articles > Item 987654321/16962

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/16962

Title:	The lower and upper forcing geodetic numbers of block–cactus graphs
Authors:	王福星 Yue-Li Wang Jou-Ming Chang
Contributors:	資管系
Keywords:	Graph theory Geodetic set Block–cactus graphs Forcing geodetic number
Date:	2006-11
Issue Date:	2010-09-23 15:00:35 (UTC+8)
Abstract:	A vertex set D in graph G is called a geodetic set if all vertices of G are lying on some shortest u–v path of G, where u, v 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 paper, we find out the lower and the upper forcing geodetic numbers of block–cactus graphs.
Relation:	European Journal of Operational Research V.175 N.1 P.238-245
Appears in Collections:	[Department of Information Management & Graduate Institute of Information Management] periodical articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	603	View/Open