×

A survey of sequences of central subgraphs. (English) Zbl 0968.05029

Summary: Because vertices most central with respect to the center (minimax distance) criterion and the median (minisum distance) criterion can be arbitrarily far apart even in trees, several sequences of central sets have been introduced. Each such sequence is based on an underlying concept that shows the center and median to be part of a spectrum of centrality measures, and several such sequences are examined. The difference between the median criterion and the centroid (maximin voting) criterion is also described, and a centroid-to-median sequence is defined for arbitrary graphs.

MSC:

05C12 Distance in graphs
90C35 Programming involving graphs or networks
90B10 Deterministic network models in operations research
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Beineke, Discr Appl Math 68 pp 249– (1996) · Zbl 0858.05033 · doi:10.1016/0166-218X(95)00069-4
[2] Buckley, J Graph Theory 5 pp 427– (1981) · Zbl 0449.05056 · doi:10.1002/jgt.3190050413
[3] Dankelmann, Discr Appl Math 79 pp 91– (1997) · Zbl 0884.05040 · doi:10.1016/S0166-218X(97)00035-8
[4] Grinstead, Congr Num 60 pp 199– (1987)
[5] Hakimi, Oper Res 12 pp 450– (1964) · Zbl 0123.00305 · doi:10.1287/opre.12.3.450
[6] Harary, Sociometry 22 pp 23– (1959) · doi:10.2307/2785610
[7] Harary, Ann Math 58 pp 134– (1953) · Zbl 0051.40502 · doi:10.2307/1969824
[8] Jordan, J Reine Angew Math 70 pp 185– (1869) · JFM 02.0344.01 · doi:10.1515/crll.1869.70.185
[9] Miller, Ars Comb 15 pp 169– (1983)
[10] Oellermann, J Graph Theory 20 pp 113– (1995) · Zbl 0834.05024 · doi:10.1002/jgt.3190200202
[11] Oellermann, J Graph Theory 14 pp 585– (1990) · Zbl 0721.05035 · doi:10.1002/jgt.3190140510
[12] Reid, Networks 21 pp 11– (1991) · Zbl 0737.05045 · doi:10.1002/net.3230210103
[13] Slater, J Res Natl Bur Stand B 79 pp 107– (1975) · doi:10.6028/jres.079B.011
[14] Slater, Congr Num 17 pp 487– (1976)
[15] Slater, J Graph Theory 2 pp 209– (1978) · Zbl 0425.05021 · doi:10.1002/jgt.3190020304
[16] Slater, Congr Num 21 pp 663– (1978)
[17] Slater, J Graph Theory 4 pp 389– (1980) · Zbl 0446.05029 · doi:10.1002/jgt.3190040408
[18] Slater, Networks 11 pp 233– (1981) · Zbl 0459.94035 · doi:10.1002/net.3230110302
[19] Centroid-to-median and centroid-to-center sequences, in preparation.
[20] Smart, Networks 34 pp 303– (1999) · Zbl 0946.05038 · doi:10.1002/(SICI)1097-0037(199912)34:4<303::AID-NET10>3.0.CO;2-#
[21] A note on the medians and the branch weight centroids of a tree, preprint, 1993.
[22] Zelinka, Arch Math (Brno) pp 87– (1968)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.