CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Strong Split Geodetic Number of a Graph

by Ashalatha K. S, Venkanagouda M Goudar, Venkatesha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Number 4
Year of Publication: 2014
Authors: Ashalatha K. S, Venkanagouda M Goudar, Venkatesha
10.5120/15487-4240

Ashalatha K. S, Venkanagouda M Goudar, Venkatesha . Strong Split Geodetic Number of a Graph. International Journal of Computer Applications. 89, 4 ( March 2014), 1-4. DOI=10.5120/15487-4240

@article{ 10.5120/15487-4240,
author = { Ashalatha K. S, Venkanagouda M Goudar, Venkatesha },
title = { Strong Split Geodetic Number of a Graph },
journal = { International Journal of Computer Applications },
issue_date = { March 2014 },
volume = { 89 },
number = { 4 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume89/number4/15487-4240/ },
doi = { 10.5120/15487-4240 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:08:20.732620+05:30
%A Ashalatha K. S
%A Venkanagouda M Goudar
%A Venkatesha
%T Strong Split Geodetic Number of a Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 4
%P 1-4
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A set S V (G) is a strong split geodetic set ofG, if S is a geodetic set and hV ??Si is totally disconnected. The strong split geodetic number of a graph G, is denoted by gss(G), is the minimum cardinality of a strong split geodetic set of G. In this paper we investigate many bounds on strong split geodetic number in terms of elements of G and covering number of G, further the relationship between strong split geodetic number and split geodetic number.

References
  1. F. Harary, Graph Theory,Addison-Wesely,Reading,MA,(1969).
  2. G. Chartrand and P. Zhang,Introduction to Graph Theory, Tata McGraw Hill Pub. Co. Ltd. (2006).
  3. G. Chartrand, F. Harary, and P. Zhang, On the geodetic number of a graph. Networks. 39, 1-6 (2002).
  4. Venkanagouda M. Goudar, K. S. Ashalatha, Venkatesha, Split Geodetic Number of a Graph, Advances and Applications in Discrete Mathematics (Paper accepted).
Index Terms

Computer Science
Information Sciences

Keywords

Cartesian product Distance Edge covering number Split geodetic number Vertex covering number.

Powered by PhDFocusTM