International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 171 - Number 7 |
Year of Publication: 2017 |
Authors: Ashalatha K. S., Venkanagouda M. Goudar |
![]() |
Ashalatha K. S., Venkanagouda M. Goudar . The Restrained Geodetic Number of a Line Graph. International Journal of Computer Applications. 171, 7 ( Aug 2017), 1-3. DOI=10.5120/ijca2017915131
For any graph G(V,E), the line graph of G denoted by L(G). The Line graph L(G) whose vertices corresponds to the edges of G and two vertices in L(G) are adjacent if and only if the corresponding edges in G are adjacent. A geodetic set S ⊆ V (G) of a graph G = (V,E) is a restrained geodetic set if the subgraph V-S has no isolated vertex. The minimum cardinality of a restrained geodetic set is the restrained geodetic number. In this paper we obtained the restrained geodetic number of line graph of any graph. Also, obtained many bounds on restrained geodetic number in terms of elements of G and covering number of G.