734
Views
0
CrossRef citations to date
0
Altmetric
Articles

Rainbow vertex-connection number on a small-world Farey graph

ORCID Icon & ORCID Icon
Pages 54-60 | Received 17 Nov 2021, Accepted 19 Mar 2022, Published online: 21 Apr 2022

References

  • Bustan, W. A., Salman, A. N. M. (2018). The rainbow vertex-connection number of star fan graphs. CAUCHY: Jurnal Matematika Murni dan Aplikasi 5(3): 112–116.
  • Chartrand, G., Johns, G. L., McKeon, K. A., Zhang, P. (2008). Rainbow connection in graphs. Math. Bohem. 133(1): 85–98.
  • Colbourn, C. J. (1982). Farey series and maximal outerplanar graphs. SIAM J. Algeb. Discrete Methods 3(2): 187–189.
  • Deng, X., Li, H., Yan, G. (2016). Algorithm on rainbow connection for maximal outerplanar graphs. Theor. Comput. Sci. 651: 76– 86.
  • Fitriani, D., Salman, A. N. M. (2016). Rainbow connection number of amalgamation of some graphs. AKCE International Journal of Graphs and Combinatorics 13(1): 90–99.
  • Hardy, G. H. (1929). An introduction to the theory of numbers. Bull. Amer. Math. Soc. 35(6): 778–818.
  • Heggernes, P., Issac, D., Lauri, J., Lima, P. T., van Leeuwen, E. J. (2018). Rainbow vertex coloring bipartite graphs and chordal graphs. In Potapov, I., Spirakis, P., and Worrell, J., editors, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), volume 117 of Leibniz International Proceedings in Informatics (LIPIcs) 13:1–83. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  • Krivelevich, M., Yuster, R. (2010). The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3): 185–191.
  • Li, W., Li, X., Zhang, J. (2018). Rainbow vertex-connection and forbidden subgraphs. Discuss. Math. Graph Theory 38(1): 143–154.
  • Li, X., Sun, Y. (2017). An updated survey on rainbow connections of graphs - a dynamic survey. tag 1(1): 1–65.
  • Li, X., Shi, Y., Sun, Y. (2013). Rainbow connections of graphs: A survey. Graphs Combin. 29(1): 1–38.
  • Liao, Y., Hou, Y., Shen, X. (2013). Tutte polynomial of a small-world farey graph. EPL 104(3): 38001.
  • Liu, H., Mestre, Â., Sousa, T. (2014). Total rainbow k-connection in graphs. Discrete Appl. Math. 174: 92–101.
  • Simamora, D. N. S, Salman, A. N. M. (2015). The rainbow (vertex) connection number of pencil graphs. Procedia Comput. Sci. 74: 138–142.
  • Sun, Y. (2013). On two variants of rainbow connection. WSEAS Trans. Math. 12: 266–276.
  • Sunil Chandran, L., Das, A., Rajendraprasad, D, Varma, N. M. (2012). Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206–218.
  • Yuster, R. (2006). Rainbow h-factors. Electron. J. Combin. 13: 13.
  • Zhai, Y., Wang, Y. (2016). Label-based routing for a family of small-world farey graphs. Sci. Rep. 6: 25621.
  • Zhang, Z., Comellas, F. (2011). Farey graphs as models for complex networks. Theor. Comput. Sci. 412(8–10): 865–875.