Induced Geodetic Sequence of a Graph

Olickal, Liju Alex; Mulloor, John Joy

doi:10.22108/toc.2024.138982.2100

تعداد نشریات	43
تعداد شماره‌ها	1,791
تعداد مقالات	14,613
تعداد مشاهده مقاله	38,754,171
تعداد دریافت فایل اصل مقاله	15,091,076

	Induced Geodetic Sequence of a Graph
Transactions on Combinatorics
مقاله 4، دوره 14، شماره 3، آذر 2025، صفحه 173-185 اصل مقاله (503.56 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22108/toc.2024.138982.2100
نویسندگان
Liju Alex Olickal¹؛ John Joy Mulloor^* ²
¹Department of Mathematics, Bishop Chulaparambil Memorial(BCM) College, Kottayam - 686001
²Department of Mathematics, Bishop Chulaparambil Memorial(BCM) College, Kottayam, Kerala, India
چکیده
A vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$. In this paper, we introduce the concepts of induced geodetic number and induced geodetic sequence of a graph. We discuss this concept in some graph classes. Also, established the characterization of induced geodetic sequences for trees, unicyclic graphs and cacti.
کلیدواژه‌ها
geodetic sequence؛ geodetic number؛ diameter؛ extreme vertex

مراجع
[1] R. Balakrishnan and K. Ranganathan, A textbook of graph theory, Second edition, Universitext. Springer, New York, 2012. [2] N. P. Bali, Golden real analysis, Firewall Media, 2005. [3] G. Chartrand, F. Harary and P. Zhang, On the geodetic number of a graph, Networks, 39 no. 1 (2002) 1–6. [4] G. Chartrand and P. Zhang, Extreme geodesic graphs, Czechoslovak Math. J., 52 no. 4 (2002) 771–780. [5] A Hansberg and L. Volkmann, On the geodetic and geodetic domination numbers of a graph, Discrete Math., 310 (2010) 2140–2146. [6] F. Harary, Graph theory, Addison-wesley publishing company, Reading, Mass, 1972. [7] F. Harary, E. Loukakis and C. Tsouros, The geodetic number of a graph, Math. Comput. Modelling, 17 no. 11 (1993) 89–95. [8] I. M. Peloyo, Geodesic convexity in graphs, Springer, 2013. [9] W. Shujing, On extremal cacti with respect to the Szeged index, Appl. Math. Comput., 309 (2017) 85–92. [10] D. Stalin and J. John, The geodetic fault tolerant domination number of a graph, South East Asian J. Math. Math. Sci., 19 no. 1 (2023) 399–412. [11] X. Zhang and H. Zhang, Some graphs determined by their spectra, Linear Algebra Appl., 431 no. 9 (2009) 1443–1454.
آمار تعداد مشاهده مقاله: 294 تعداد دریافت فایل اصل مقاله: 271

سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب

پیوندهای مفید

اخبار و اعلانات

آمار

Induced Geodetic Sequence of a Graph