Skip to main content

A characterization of centroidal graphs

Seminars

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1403)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.A. DIRAC, On rigid circuit graphs, Abh. Math. Seminar Univ. Hamburg 25 (1961), 71–76.

    CrossRef  Google Scholar 

  2. M. FARBER, R.E. JAMISON, Convexity in graphs and hypergraphs, Res. Rep. Corr 83–46, Faculty of Math., University of Waterloo.

    Google Scholar 

  3. M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. R.E. JAMISON-WALDNER, Copoints in antimatroids, Congr. Numer. 29 (1980), 535–544.

    Google Scholar 

  6. R.E. JAMISON, P.H. EDELMAN, The theory of convex geometries, Geom. Dedicata. 19 (1985), 247–270.

    Google Scholar 

  7. E.E. JAMISON, R. NOWAKOWSKI, A Helly theorem for convexity in graphs, Discrete Math. 51 (1984), 35–39.

    CrossRef  Google Scholar 

  8. C. JORDAN, Sur les assemblages de lignes, J. reine und angew. Math. 70 (1869), 185–190.

    CrossRef  Google Scholar 

  9. G. KÖTHE, Topologische Lineare Räume 1, Berlin, Springer-Verlag, 1960, pp. 188–193.

    CrossRef  Google Scholar 

  10. W. PIOTROWSKI, A generalization of branch weight centroids, to appear.

    Google Scholar 

  11. P.J. SLATER, Maximin facility location, J. Res. Nat. Bur. Standards B 79 (1975), 107–115.

    Google Scholar 

  12. P.J. SLATER, Accretion centers: a generalization of branch weight centroids, Discrete Appl. Math. 3 (1981), 187–192.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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