Skip to main content
SpringerLink
Log in

Almost self-centered graphs

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-central vertices. The block structure of these graphs is described and constructions for generating such graphs are proposed. Embeddings of arbitrary graphs into ASC graphs are studied. In particular it is shown that any graph can be embedded into an ASC graph of prescribed radius. Embeddings into ASC graphs of radius two are studied in more detail. ASC index of a graph G is introduced as the smallest number of vertices needed to add to G such that G is an induced subgraph of an ASC graph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akiyama, J., Ando, J. K., Avis, D.: Miscellaneous Properties of Equi-Eccentric Graphs. In: Convexity and graph theory (Jerusalem, 1981), North-Holland Math. Stud. 87, 13–23, North-Holland, Amsterdam, 1984

    Google Scholar 

  2. Buckley, F., Miller, Z., Slater, P. J.: On graphs containing a given graph as center. J. Graph Theory, 5, 427–434 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Janakiraman, T. N.: On self-centered graphs. J. Ramanujan Math. Soc., 7, 83–92 (1992)

    MathSciNet  MATH  Google Scholar 

  4. Negami, S., Xu, G. H.: Locally geodesic cycles in 2-self-centered graphs. Discrete Math., 58, 263–268 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Buckley, F.: Self-centered graphs. Ann. New York Acad. Sci., 576, 71–78 (1989)

    Article  MathSciNet  Google Scholar 

  6. Lee, S.-M., Wang, P.-C.: On groups of automorphisms of self-centered graphs. Bull. Math. Soc. Sci. Math. Roumanie (N. S.), 34(82), 311–316 (1990)

    MathSciNet  Google Scholar 

  7. Janakiraman, T. N., Bhanumathi, M., Muthammai, S.: Self-centered super graph of a graph and center number of a graph. Ars Combin., 87, 271–290 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Chartrand, G., Gu, W., Schultz, M., et al.: Eccentric graphs. Networks, 34, 115–121 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gimbert, J., López, N., Miller, M., et al.: Characterization of eccentric digraphs. Discrete Math., 306, 210–219 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Walikar, H. B., Narayankar, K. P.: Almost self-centered ASC(R)-graphs. Submitted

  11. Huang, T. C., Lin, J.-C., Chen, H.-J.: A self-stabilizing algorithm which finds a 2-center of a tree. Comput. Math. Appl., 40, 607–624 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Puerto, J., Tamir, A., Mesa, J. A., et al.: Center location problems on tree graphs with subtree-shaped customers. Discrete Appl. Math., 156, 2890–2910 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Wang, H.-L., Wu, B. Y., Chao, K.-M.: The backup 2-center and backup 2-median problems on trees. Networks, 53, 39–49 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Liu, Y., Yan, G. Y.: Graphs isomorphic to their maximum matching graphs. Acta Mathematica Sinica, English Series, 25, 1507–1516 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Harary, F.: Graph Theory, Addision-Wesley, Reading, Massachussets, 1969

    Google Scholar 

  16. Sohn, M. Y., Kim, S. B., Kwon, Y. S., et al.: Classification of regular planar graphs with diameter two. Acta Mathematica Sinica, English Series, 23, 411–416 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, University of Ljubljana, 1000, Ljubljana, Slovenia

    Sandi Klavžar

  2. Faculty of Natural Sciences and Mathematics, University of Maribor, 2000, Maribor, Slovenia

    Sandi Klavžar

  3. Department of Computer Science, Karnatak University, Dharwad, 580003, India

    Kishori P. Narayankar & H. B. Walikar

Authors
  1. Sandi Klavžar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kishori P. Narayankar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. B. Walikar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sandi Klavžar.

Additional information

The first author is supported by the Ministry of Science of Slovenia under the grant P1-0297

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klavžar, S., Narayankar, K.P. & Walikar, H.B. Almost self-centered graphs. Acta. Math. Sin.-English Ser. 27, 2343–2350 (2011). https://doi.org/10.1007/s10114-011-9628-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-011-9628-3

Keywords

MR(2000) Subject Classification

Search

Navigation