Abstract
We give necessary and sufficient conditions for a graph to be a centroid of another one as well as of itself. Then, we apply these results to some particular classes of graphs: chordal, Halin, series-parallel and outerplanar.
Research supported by the Government Grant CPBP 02.17
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G.A. DIRAC, On rigid circuit graphs, Abh. Math. Seminar Univ. Hamburg 25 (1961), 71–76.
M. FARBER, R.E. JAMISON, Convexity in graphs and hypergraphs, Res. Rep. Corr 83–46, Faculty of Math., University of Waterloo.
M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980.
R.E. JAMISON-WALDNER, A perspective on abstract convexity: classifying alignments by varieties, in: D.C. Kay and B. Drech (eds.), Convexity and Related Combinatorial Geometry, M. Dekker, New York 1982, pp. 113–150.
R.E. JAMISON-WALDNER, Copoints in antimatroids, Congr. Numer. 29 (1980), 535–544.
R.E. JAMISON, P.H. EDELMAN, The theory of convex geometries, Geom. Dedicata. 19 (1985), 247–270.
E.E. JAMISON, R. NOWAKOWSKI, A Helly theorem for convexity in graphs, Discrete Math. 51 (1984), 35–39.
C. JORDAN, Sur les assemblages de lignes, J. reine und angew. Math. 70 (1869), 185–190.
G. KÖTHE, Topologische Lineare Räume 1, Berlin, Springer-Verlag, 1960, pp. 188–193.
W. PIOTROWSKI, A generalization of branch weight centroids, to appear.
P.J. SLATER, Maximin facility location, J. Res. Nat. Bur. Standards B 79 (1975), 107–115.
P.J. SLATER, Accretion centers: a generalization of branch weight centroids, Discrete Appl. Math. 3 (1981), 187–192.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Piotrowski, W., Sysło, M.M. (1989). A characterization of centroidal graphs. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083471
Download citation
DOI: https://doi.org/10.1007/BFb0083471
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51797-9
Online ISBN: 978-3-540-46810-3
eBook Packages: Springer Book Archive
