Classifying trees with edge-deleted central appendage number 2
The eccentricity of a vertex of a connected graph is the distance from to a vertex farthest from in . The center of is the subgraph of induced by the vertices having minimum eccentricity. For a vertex in a 2-edge-connected graph , the edge-deleted eccentricity of is defined to be the maximum eccentricity of in over all edges of . The edge-deleted center of is the subgraph induced by those vertices of having minimum edge-deleted eccentricity. The edge-deleted central...