|
|
|
|
induced geodetic sequence of a graph
|
|
|
|
|
|
|
|
نویسنده
|
olickal liju alex ,mulloor john joy ,mulloor john joy
|
|
منبع
|
transactions on combinatorics - 2025 - دوره : 14 - شماره : 3 - صفحه:173 -185
|
|
چکیده
|
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 ∈ 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 number ,geodetic sequence ,geodetic number ,diameter ,extreme vertex
|
|
آدرس
|
bishop chulaparambil memorial (bcm) college, department of mathematics, india, st. stephen’s college, department of mathematics, india. bishop chulaparambil memorial (bcm) college, department of mathematics, india, st. stephen’s college, department of mathematics, india. bishop chulaparambil memorial (bcm) college, department of mathematics, india
|
|
پست الکترونیکی
|
johnjoy@bcmcollege.ac.in
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|