Detour Number of 1-Fault Connected Graphs

• Autorzy: Raghu T. Venkata , Sundara Rajan R. , Ramesh Babu A. , Anil S.

Identyfikatory

DOI

10.3233/FI-2020-1894

• Języki publikacji: EN

Abstrakty

EN

A subset S of a connected graph G of order n is called a detour set of G if for every vertex x in G there exist vertices u, v in S such that x lie on a u – v detour path. The detour number dn(G) of a graph G is the minimum cardinality of a detour set. In this paper we compute the detour number of certain 1-fault connected planar graphs.

Słowa kluczowe

EN

1-fault connected graphs; detour number; detour set; Geodetic number; Hanoi graph; Sierpiński graph

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2020
• Tom: Vol. 172, nr 1
• Strony: 97--104
• Opis fizyczny: Bibliogr. 15 poz., rys.

Twórcy

autor

Raghu T. Venkata

• Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India

autor

Sundara Rajan R.

• Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India

autor

Ramesh Babu A.

• Department of Mathematics, Hindustan Institute of Technology and Science, Chennai 603 103, India

autor

Anil S.

• Department of Computer Science and Engineering, Hindustan Institute of Technology and Science, Chennai 603 103, India

Bibliografia

• [1] Harary F. Graph Theory. Addison-Wesley series in mathematics. Addison-Wesley Pub. Co., 1969. URL https://books.google.co.in/books?id=QNxgQZQH868C.
• [2] West DB. Introduction to Graph Theory. Prentice Hall, 2nd ed edition, 2001. URL http://gen.lib.rus.ec/book/index.php?md5=B93C24AD9AC6C058EFBD4E2EAFAF296F.
• [3] Buckley F, Harary F. Distance in Graphs. Addison-Wesley, 1990. URL http://gen.lib.rus.ec/book/index.php?md5=BF1E4FA74634808EA765ABB0702A9951.
• [4] Chartrand G, Harary F, Zhang P. On the Geodetic Number of a Graph. Networks, 2002. 39:1-6. doi:10.1002/net.10007.
• [5] Harary F, Loukakis E, Tsouros C. The Geodetic Number of a Graph. Mathematical and Computer Modelling, 1993. 17(11):89-95. doi:10.1016/0895-7177(93)90259-2.
• [6] Chartrand G, Johns G, Zhang P. The Detour Number of a Graph. Utilitas Mathematica, 2003. 64:97-113.
• [7] Chartrand G, Johns G, Zhang P. On the Detour Number and Geodetic Number of a Graph. Ars Comb., 2004. 72:3-15.
• [8] Chartrand G, Escuadro H, Zhang P. Detour Distance in Graphs. The Journal of Combinatorial Mathematics and Combinatorial Computing, 2005. 53:75-94.
• [9] Chartrand G, Zang P. Distance in Graphs-Taking the Long View. AKCE International Journal of Graphs and Combinatorics, 2004. 1:1-13.
• [10] Umamaheswari. A Study on Fuzzy Detour Distance in Fuzzy Graphs. Ph.D. thesis, Mother Teresa Womens University, 2013.
• [11] Hsu LH, Lin CK. Graph Theory and Iinterconnection Networks. CRC press, 2008. ISBN-9781420044812.
• [12] Sundara Rajan R, Manuel P, Rajasingh I, Parthiban N, Miller M. A Lower Bound for Dilation of an Embedding. The Computer Journal, 2015. 58(12):3271-3278. doi:10.1093/comjnl/bxv021. URL https://doi.org/10.1093/comjnl/bxv021.
• [13] Klavžar, Sandi, Mohar B. Crossing Numbers of Sierpiński-Like Graphs. Journal of Graph Theory, 2005. 50(3):186-198. doi:10.1002/jgt.20107.
• [14] Klavžar S. Coloring Sierpiński Graphs and Sierpiński Gasket Graphs. Taiwanese Journal of Mathematics, 2008. 12:513-522. URL https://www.jstor.org/stable/43833928.
• [15] M Teguia A, Godbole A. Sierpiński Gasket Graphs and Some of Their Properties. Australasian Journal of Combinatorics, 2005. 35:181-192. arXiv:math/0509259.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).