The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
O problema de encontrar a localização do centro e o problema de encontrar a mediana em um gráfico são importantes e básicos entre muitos problemas de localização de rede. Em conexão com estes dois problemas, os dois teoremas seguintes são bem conhecidos. Uma delas foi provada por Jordan e Sylvester e mostra que o centro de cada árvore consiste em um vértice ou em dois vértices adjacentes. A outra é provada por Jordan e mostra que o centróide (mediana) de cada árvore consiste em um vértice ou em dois vértices adjacentes. Esses teoremas foram generalizados por muitos pesquisadores até agora. Harary e Norman provaram que o centro de todo gráfico conectado G está em um único bloco de G. Truszczynski provou que a mediana de cada gráfico conectado G está em um único bloco de G. Slater definido k-centrum, que pode expressar tanto o centro quanto a mediana, e provou que o k-centrum de cada árvore consiste em um vértice ou dois vértices adjacentes. Este artigo discute a generalização desses teoremas. Nós definimos o
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Masashi TAKEUCHI, Shoji SOEJIMA, "On a Relation between -Centroid and -Blocks in a Graph" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 2009-2014, October 2000, doi: .
Abstract: The problem of finding the location of the center and the problem of finding the median in a graph are important and basic among many network location problems. In connection with these two problems, the following two theorems are well-known. One is proved by Jordan and Sylvester, and it shows that the center of every tree consists of either one vertex or two adjacent vertices. The other is proved by Jordan and it shows that the centroid (median) of every tree consists of either one vertex or two adjacent vertices. These theorems have been generalized by many researchers so far. Harary and Norman proved that the center of every connected graph G lies in a single block of G. Truszczynski proved that the median of every connected graph G lies in a single block of G. Slater defined k-centrum, which can express both center and median, and proved that the k-centrum of every tree consists of either one vertex or two adjacent vertices. This paper discusses generalization of these theorems. We define the
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_2009/_p
Copiar
@ARTICLE{e83-a_10_2009,
author={Masashi TAKEUCHI, Shoji SOEJIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On a Relation between -Centroid and -Blocks in a Graph},
year={2000},
volume={E83-A},
number={10},
pages={2009-2014},
abstract={The problem of finding the location of the center and the problem of finding the median in a graph are important and basic among many network location problems. In connection with these two problems, the following two theorems are well-known. One is proved by Jordan and Sylvester, and it shows that the center of every tree consists of either one vertex or two adjacent vertices. The other is proved by Jordan and it shows that the centroid (median) of every tree consists of either one vertex or two adjacent vertices. These theorems have been generalized by many researchers so far. Harary and Norman proved that the center of every connected graph G lies in a single block of G. Truszczynski proved that the median of every connected graph G lies in a single block of G. Slater defined k-centrum, which can express both center and median, and proved that the k-centrum of every tree consists of either one vertex or two adjacent vertices. This paper discusses generalization of these theorems. We define the
keywords={},
doi={},
ISSN={},
month={October},}
Copiar
TY - JOUR
TI - On a Relation between -Centroid and -Blocks in a Graph
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2009
EP - 2014
AU - Masashi TAKEUCHI
AU - Shoji SOEJIMA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - The problem of finding the location of the center and the problem of finding the median in a graph are important and basic among many network location problems. In connection with these two problems, the following two theorems are well-known. One is proved by Jordan and Sylvester, and it shows that the center of every tree consists of either one vertex or two adjacent vertices. The other is proved by Jordan and it shows that the centroid (median) of every tree consists of either one vertex or two adjacent vertices. These theorems have been generalized by many researchers so far. Harary and Norman proved that the center of every connected graph G lies in a single block of G. Truszczynski proved that the median of every connected graph G lies in a single block of G. Slater defined k-centrum, which can express both center and median, and proved that the k-centrum of every tree consists of either one vertex or two adjacent vertices. This paper discusses generalization of these theorems. We define the
ER -