On the edge geodetic and edge geodetic domination numbers of a graph
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...
Main Author: | Vladimir Samodivkin |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2020-06-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13946_a04e695bc31f9c7d591a19cbb7f8733e.pdf |
Similar Items
-
The upper edge geodetic number and the forcing edge geodetic number of a graph
by: A. P. Santhakumaran, et al.
Published: (2009-01-01) -
The geodetic domination number of comb product graphs
by: Dimas Agus Fahrudin, et al.
Published: (2020-10-01) -
The geodetic domination number for the product of graphs
by: S. Robinson Chellathurai, et al.
Published: (2014-12-01) -
On Minimal Geodetic Domination in Graphs
by: Nuenay Hearty M., et al.
Published: (2015-08-01) -
The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity
by: H. Abdollahzadeh Ahangar, et al.
Published: (2017-12-01)