The week's pick
Random Articles
Reseach Article
The Restrained Geodetic Number of a Line Graph
| 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 |
10.5120/ijca2017915131
|
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
Abstract
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.
References
- F Buckley and F. Harary. Distance in graphs, Addison-Wesely, Reading, MA (1990).
- G. Chartrand, F. Harary, and P.Zhang. Geodetic sets in graphs Discussiones Mathematicae Graph Theory 20 (2000), 129-138.
- G. Chartrand, F. Harary, H.C Swart and P.Zhang. Geodomination in graphs, Bull. ICA 31 (2001), 51-59.
- G. Chartrand, F. Harary, and P.Zhang. On the geodetic number of a graph.Networks.39 (2002) 1-6.
- G. Chartrand and P.Zhang. Introduction to Graph Theory, Tata McGraw Hill Pub.Co.Ltd.(2006).
- F.Harary, Graph Theory, Addison-Wesely, Reading, MA, 1969.
Index Terms
Keywords