Skip to main content
Log in

More on betweenness-uniform graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

We study graphs whose vertices possess the same value of betweenness centrality (which is defined as the sum of relative numbers of shortest paths passing through a given vertex). Extending previously known results of S. Gago, J. Hurajová, T. Madaras (2013), we show that, apart of cycles, such graphs cannot contain 2-valent vertices and, moreover, are 3-connected if their diameter is 2. In addition, we prove that the betweenness uniformity is satisfied in a wide graph family of semi-symmetric graphs, which enables us to construct a variety of nontrivial cubic betweenness-uniform graphs.

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

Access this article

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. J. Akiyama, K. Ando, D. Avis: Miscellaneous properties of equi-eccentric graphs. Convexity and Graph Theory. Proc. Conf., Jerusalem, 1981, Ann. Discrete Math. 20; North-Holland Mathematics Studies 87, North-Holland, Amsterdam, 1984, pp. 13–23.

    Google Scholar 

  2. K. Balakrishnan, M. Changat, I. Peterin, S. Špacapan, P. Šparl, A. R. Subhamathi: Strongly distance-balanced graphs and graph products. Eur. J. Comb. 30 (2009), 1048–1053.

    Article  MathSciNet  MATH  Google Scholar 

  3. F. Buckley: Self-centered graphs with a given radius. Proc. 10th southeast. Conf. Combinatorics, Graph Theory and Computing, Boca Raton, 1979. Congr. Numerantium 23, 1979, pp. 211–215.

    Google Scholar 

  4. F. Buckley: Self-centered graphs. Proc. Conf., Jinan, 1986. Ann. N. Y. Acad. Sci. 576, New York Academy of Sciences, New York, 1989, pp. 71–78.

    Google Scholar 

  5. G. Caporossi, M. Paiva, D. Vukicević, M. Segatto: Centrality and betweenness: vertex and edge decomposition of theWiener index. MATCH Commun. Math. Comput. Chem. 68 (2012), 293–302.

    MathSciNet  MATH  Google Scholar 

  6. F. Comellas, S. Gago: Spectral bounds for the betweenness of a graph. Linear Algebra Appl. 423 (2007), 74–80.

    Article  MathSciNet  MATH  Google Scholar 

  7. R. Diestel: Graph Theory. Graduate Texts in Mathematics 173, Springer, Berlin, 2010.

    Google Scholar 

  8. L. C. Freeman: A set of measures of centrality based on betweenness. Sociometry 40 (1977), 35–41.

    Article  Google Scholar 

  9. S. Gago, J. Coronicová Hurajová, T. Madaras: On betweenness-uniform graphs. Czech. Math. J. 63 (2013), 629–642.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Knor, T. Madaras: On farness- and reciprocally-selfcentric antisymmetric graphs. Congr. Numerantium 171 (2004), 173–178.

    MathSciNet  MATH  Google Scholar 

  11. A. Malnic, D. Marušic, P. Potocnik, C. Wang: An infinite family of cubic edge- but not vertex-transitive graphs. Discrete Math. 280 (2004), 133–148.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Plesník: On the sum of all distances in a graph or digraph. J. Graph Theory 8 (1984), 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  13. E. W. Weisstein: Generalized Petersen Graph. From MathWorld—A Wolfram Web Resource, available at https://doi.org/mathworld.wolfram.com/GeneralizedPetersenGraph.html.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jana Coroničová Hurajová.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Coroničová Hurajová, J., Madaras, T. More on betweenness-uniform graphs. Czech Math J 68, 293–306 (2018). https://doi.org/10.21136/CMJ.2018.0087-16

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.21136/CMJ.2018.0087-16

Keywords

MSC 2010

Navigation