Classifying trees with edge-deleted central appendage number 2

Title:

Classifying trees with edge-deleted central appendage number 2

Creator:

Stalder, Shubhangi, Eroh, Linda, Koker, John, Moghadam, Hosien S., and Winters, Steven J.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:d9e57354-dab9-41b3-965b-149b6a7c398e
uuid:d9e57354-dab9-41b3-965b-149b6a7c398e
doi:10.21136/MB.2009.140644

Subject:

graphs, trees, and central appendage number

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The eccentricity of a vertex v of a connected graph G is the distance from v to a vertex farthest from v in G. The center of G is the subgraph of G induced by the vertices having minimum eccentricity. For a vertex v in a 2-edge-connected graph G, the edge-deleted eccentricity of v is defined to be the maximum eccentricity of v in G − e over all edges e of G. The edge-deleted center of G is the subgraph induced by those vertices of G having minimum edge-deleted eccentricity. The edge-deleted central appendage number of a graph G is the minimum difference |V (H)| − |V (G)| over all graphs H where the edgedeleted center of H is isomorphic to G. In this paper, we determine the edge-deleted central appendage number of all trees.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

99-110

Source:

Mathematica bohemica | 2009 Volume:134 | Number:1

Harvested from:

CDK

Metadata only:

false