Isometric-path numbers of block graphs

Information Processing Letters

Volumn 93, Issue 2, 2005, Pages 99-102

  Pan, Jun Jie ^a   Chang, Gerard J ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Block graph; Cut vertex; Isometric path

Indexed keywords

ALGORITHMS; FUNCTIONS; NUMBER THEORY; SET THEORY; THEOREM PROVING;

BLOCK GRAPH; CUT-VERTEX; ISOMETRIC PATH;

GRAPH THEORY;

EID: 10044241718     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.09.021     Document Type: Article

References (8)

1. M. Aigner, M. Fromme, A game of cops and robbers, Discrete Appl. Math. 8 (1984) 1-12.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
3. D.C. Fisher, S.L. Fitzpatrick, The isometric path number of a graph, J. Combin. Math. Combin. Comput. 38 (2001) 97-110.
4. S.L. Fitzpatrick, Aspects of domination and dynamic domination, Ph.D. Thesis, Dalhousie University, Nova Scotia, Canada, 1997.
5. S.L. Fitzpatrick, The isometric path number of the Cartesian product of paths, Congr. Numer. 137 (1999) 109-119.
6. S.L. Fitzpatrick, R.J. Nowakowski, D. Holton, I. Caines, Covering hypercubes by isometric paths, Discrete Math. 240 (2001) 253-260.
7. R. Nowakowski, P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 43 (1983) 235-239.
8. e cycle, Université de Paris VI, 1978.