Nordhaus-Gaddum results for the convex domination number of a graph |
| |
| Authors: | M Lemańska J A Rodríguez-Velázquez I Gonzalez Yero |
| |
| Institution: | 1. Department of Technical Physics and Applied Mathematics, Gda??sk University of Technology, ul. Narutowicza 11/12, 80-233, Gda??sk, Poland
2. Departament d??Enginyeria Inform??tica i Matem??tiques, Universitat Rovira i Virgili, Av. Pa?sos Catalans 26, 43007, Tarragona, Spain
|
| |
| Abstract: | The distance d G (u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length d G (u, v) is called a uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for any two vertices a, b ?? X. The convex domination number ??con(G) of a graph G equals the minimum cardinality of a convex dominating set. In the paper, Nordhaus-Gaddum-type results for the convex domination number are studied. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
