Paper Info
Title
An infinite class of reach-preservable graphs.
Abstract
A vertex v of a spanning tree T of a graph G is called reach-preserving if d(G)(v, w) = d(T)(v, w) for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reach-preserving vertex. We show that K-2,K-n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-preserved. (C) 1997 John Wiley & Sons, Inc.
Year
DOI
Venue
1997
10.1002/(SICI)1097-0037(199707)29:4<217::AID-NET4>3.0.CO;2-I
NETWORKS
Field
DocType
Volume
Discrete mathematics,Combinatorics,Trémaux tree,Minimum degree spanning tree,Graph power,Bound graph,Vertex (graph theory),Neighbourhood (graph theory),Cycle graph,Spanning tree,Mathematics
Journal
29
Issue
ISSN
Citations 
4
0028-3045
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Daniel Gagliardi100.34
Marty Lewinter200.34