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

The Geodetic Parameters of Strong Product Graphs

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

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 101 - Number 12
Year of Publication: 2014
Authors: Ashalatha K.s, Venkanagouda M Goudar, Venkatesha
10.5120/17736-8835

Ashalatha K.s, Venkanagouda M Goudar, Venkatesha . The Geodetic Parameters of Strong Product Graphs. International Journal of Computer Applications. 101, 12 ( September 2014), 1-6. DOI=10.5120/17736-8835

@article{ 10.5120/17736-8835,
author = { Ashalatha K.s, Venkanagouda M Goudar, Venkatesha },
title = { The Geodetic Parameters of Strong Product Graphs },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 101 },
number = { 12 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume101/number12/17736-8835/ },
doi = { 10.5120/17736-8835 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:31:27.067942+05:30
%A Ashalatha K.s
%A Venkanagouda M Goudar
%A Venkatesha
%T The Geodetic Parameters of Strong Product Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 101
%N 12
%P 1-6
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A set S V (G) is a split geodetic set of G, if S is a geodetic set and hV . . Si is disconnected. The split geodetic number of a graph G, is denoted by gs(G), is the minimum cardinality of a split geodetic set of G. A set S V (G) is a strong split geodetic set of G, 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 obtain the geodetic number, split geodetic number, strong split geodetic number and non split geodetic number of strong product graphs, composition of graphs and join of graphs.

References
  1. Ashalatha K. S. ,Venkanagouda. M. Goudar, Venkatesha. , 2014. Strong split geodetic number of a graph, International Journal of Computer Applications. , 89(4) (2014), 1-4
  2. G. Chartrand, F. Harary, and P. Zhang, 2002. On the geodetic number of a graph. Networks. 39,(2002),1-6.
  3. G. Chartrand and P. Zhang, 2006. Introduction to Graph Theory, Tata McGraw Hill Pub. Co. Ltd.
  4. F. Harary, 1969. Graph Theory,Addison-Wesely,Reading,MA.
  5. Venkanagouda M. Goudar, K. S. Ashalatha, Venkatesha, 2014. Split Geodetic Number of a Graph, Advances and Applications in Discrete Mathematics. 13(1) (2014), 9-22.
  6. Venkanagouda. M. Goudar, Tejaswini K. M, Venkatesha. , Non split geodetic number of a graph, Indian Journal of Pure and Applie Mathematics. (Communicated).
Index Terms

Computer Science
Information Sciences

Keywords

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

Powered by PhDFocusTM