2013/10/06 by Vladimir Samodivkin, Samodivkin, Vladimir
Computer Science · #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1310.1610
openalex publication_date 2013/10/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the restrained bondage number, the total restrained bondage number and the restricted edge connectivity of graphs in terms of the orientable/nonorientable genus and maximum degree.