|
|
|
|
On the Edge Geodetic and Edge Geodetic Domination Numbers of A Graph
|
|
|
|
|
|
|
|
نویسنده
|
Samodivkin Vladimir
|
|
منبع
|
Communications In Combinatorics And Optimization - 2020 - دوره : 5 - شماره : 1 - صفحه:41 -54
|
|
|
|
|
چکیده
|
In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers. we also obtain attainable upper bounds on the maximum number of elements in a partition of a vertex set of a connected graph into geodetic sets, edge geodetic sets, geodetic dominating sets and edge geodetic dominating sets, respectively.
|
|
کلیدواژه
|
Domination Number ,(Edge) Geodetic Number ,(Edge) Geodetic Domination Number
|
|
آدرس
|
University Of Architecture, Department Of MathematicsDepartment Of Mathematics, Bulgaria
|
|
پست الکترونیکی
|
vl.samodivkin@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|