Research Article

Strong Non-Split Geodetic Number of a Line Graph

by  Ashalatha K.S.
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 185 - Issue 10
Published: May 2023
Authors: Ashalatha K.S.
10.5120/ijca2023922779
PDF

Ashalatha K.S. . Strong Non-Split Geodetic Number of a Line Graph. International Journal of Computer Applications. 185, 10 (May 2023), 47-50. DOI=10.5120/ijca2023922779

                        @article{ 10.5120/ijca2023922779,
                        author  = { Ashalatha K.S. },
                        title   = { Strong Non-Split Geodetic Number of a Line Graph },
                        journal = { International Journal of Computer Applications },
                        year    = { 2023 },
                        volume  = { 185 },
                        number  = { 10 },
                        pages   = { 47-50 },
                        doi     = { 10.5120/ijca2023922779 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2023
                        %A Ashalatha K.S.
                        %T Strong Non-Split Geodetic Number of a Line Graph%T 
                        %J International Journal of Computer Applications
                        %V 185
                        %N 10
                        %P 47-50
                        %R 10.5120/ijca2023922779
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

A Set S⊑V[L(G)] is a strong non split geodetic set of L(G), if ‘S’ is a geodetic set and 〈V-S〉 is complete. The strong non split geodetic number of a line graph L(G), is denoted by g_sns [L(G)], is the minimum cardinality of a strong non split geodetic set of L(G). In this paper we obtain the strong non split geodetic number of line graph of some special graph and many bounds on strong non split geodetic numbers in terms of elements of G.

References
  • F. Harary, 1969, Graph Theory, Addison-Wesely, Reading, MA, (1969)
  • G.Chartrand and P.Zhang, 2006, Introduction to Graph Theory, Tata McGraw Hill Pub.Co.Ltd.
  • Venkangouda M. Goudar, K.S. Ashalatha, Venkatesha, M.H. Muddebihal, 2012, On the Geodetic number of Line Graph, Int. J. Contemp. Math. Sciences, Vol, 7, no 46, pp.2289-2295
  • G. Chartrand, F.Harary and P.Zhang. 2002, On the geodetic number of a graph. Networks, 39, pp,1-6
  • Venkangouda M. Goudar, Tejaswini K M, Venkatesha, 2014, Strong Non split geodetic number of a graph, IJCA issue 4 vol 5 pp, 171-183
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Tadpole graph Banana tree graph Helm graph Line graph strong non split geodetic number of a line graph.

Powered by PhDFocusTM