Research Article
Independent Transversal Geodetic Number of a Graph
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 68 |
| Published: December 2025 |
| Authors: M. Perumalsamy, R. Vasanthi |
10.5120/ijca2025926007
|
M. Perumalsamy, R. Vasanthi . Independent Transversal Geodetic Number of a Graph. International Journal of Computer Applications. 187, 68 (December 2025), 1-7. DOI=10.5120/ijca2025926007
@article{ 10.5120/ijca2025926007,
author = { M. Perumalsamy,R. Vasanthi },
title = { Independent Transversal Geodetic Number of a Graph },
journal = { International Journal of Computer Applications },
year = { 2025 },
volume = { 187 },
number = { 68 },
pages = { 1-7 },
doi = { 10.5120/ijca2025926007 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2025
%A M. Perumalsamy
%A R. Vasanthi
%T Independent Transversal Geodetic Number of a Graph%T
%J International Journal of Computer Applications
%V 187
%N 68
%P 1-7
%R 10.5120/ijca2025926007
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A subset S ⊆ V is said to be a geodetic set in G = (V, E) if each vertex of G lies on at least one shortest path between some pair of vertices u, v ∈ S. The cardinality of the minimum geodetic set is known as geodetic number of G, denoted by g(G) [4, 5]. A subset I ⊆ V is said to be independent if there is no edge between every pair of vertices u, v ∈ I [3]. A geodetic set S ⊆ V (G) that intersects every maximum independent set (β0-set) of G is called an independent transversal geodetic set. This study produces the new notion of independent transversal geodetic number among geodetic sets. It explores the characteristics of this new parameter within several well-known graph families and offer an in-depth investigation of the fundamental properties of independent transversal geodetic number.
References
- F. BUCKLEY AND F. HARARY, Distance in Graphs, Addison- Wesley, Redwood City, CA, 1990.
- GARY CHATRAND AND PING ZHANG, Introduction to Graph Theory , Eighth Reprint 2012, Tata McGraw Hill Education Private Limited, New Delhi.
- F. HARARY, Graph Theory, Addison-Wesley, 1969.
- FRANK HARARY, EMMANUEL LOUKAKIS, CONSTANTINE TSOUROS, The geodetic number of a graph, Mathematical and Computer modelling, Volume 17, Issue 11, June 1993, Pages 89-95
- GARY CHARTRAND, FRANK HARARY, PING ZHANG, On the geodetic number of a graph, NETWORKS An International Journal, Volume 39, Issue 1. (2002), pages 1-6
- ISMAIL SAHUL HAMID, Independent Transversal Domination in Graphs, Discussiones Mathematicae Graph Theory, Vol. 32, Issue 1, pp 5-17, 2012
- J.JOHN, Comment on ”Analogies between the geodetic number and the steiner Number of some classes of graphs”,Filomat 37: 2(2023), 583-589
- R.VASANTHI, K.SUBRAMANIAN, Vertex covering transversal domination in graphs, International Journal of Mathematics and Soft Computing, Vol. 5, No. 2 (2015), 01 - 07
- R.VASANTHI, K.SUBRAMANIAN, On vertex covering transversal domination number of regular graphs, The Scientific World Journal, Vol 2016, Article ID 1029024, 7 pages
- R.VASANTHI, M.PERUMALSAMY, Independent Transversal Steiner Number of a Graph, Indian Journal of Natural Sciences, Vol. 16 / Issue 89 / April / 2025, 10 pages
Index Terms
Keywords