Stalder, Shubhangi, et al. "Classifying trees with edge-deleted central appendage number 2." Mathematica Bohemica 134.1 (2009): 99-110. <http://eudml.org/doc/38077>.
@article{Stalder2009,
abstract = {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 edge-deleted center of $H$ is isomorphic to $G$. In this paper, we determine the edge-deleted central appendage number of all trees.},
author = {Stalder, Shubhangi, Eroh, Linda, Koker, John, Moghadam, Hosien S., Winters, Steven J.},
journal = {Mathematica Bohemica},
keywords = {graphs; trees; central appendage number; graphs; trees; central appendage number},
language = {eng},
number = {1},
pages = {99-110},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Classifying trees with edge-deleted central appendage number 2},
url = {http://eudml.org/doc/38077},
volume = {134},
year = {2009},
}
TY - JOUR
AU - Stalder, Shubhangi
AU - Eroh, Linda
AU - Koker, John
AU - Moghadam, Hosien S.
AU - Winters, Steven J.
TI - Classifying trees with edge-deleted central appendage number 2
JO - Mathematica Bohemica
PY - 2009
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 134
IS - 1
SP - 99
EP - 110
AB - 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 edge-deleted center of $H$ is isomorphic to $G$. In this paper, we determine the edge-deleted central appendage number of all trees.
LA - eng
KW - graphs; trees; central appendage number; graphs; trees; central appendage number
UR - http://eudml.org/doc/38077
ER -
