论文信息 - On the geodetic number of complementary prisms

On the geodetic number of complementary prisms

Abstract Motivated by previous work, we prove that, given a graph G and a positive integer k, deciding whether the geodetic number of the complementary prism of G is at most k is an NP -complete problem. We also show lower and upper bounds for the geodetic number of a complementary prism, and determine the geodetic number of a complementary prism when it is defined over a split graph.

Diane Castonguay | Hebert Coelho | Erika M. M. Coelho | Julliano R. Nascimento

[1] David Peleg,et al. Local majorities, coalitions and monopolies in graphs: a review , 2002, Theor. Comput. Sci..

[2] Dieter Rautenbach,et al. On the geodetic hull number of Pk-free graphs , 2016, Theor. Comput. Sci..

[3] Dieter Rautenbach,et al. Recognizing some complementary products , 2014, Theor. Comput. Sci..

[4] Frank Harary,et al. On the geodetic number of a graph , 2002, Networks.

[5] Dieter Rautenbach,et al. Complexity properties of complementary prisms , 2017, J. Comb. Optim..

[6] Mustafa Atici,et al. Computational Complexity of Geodetic Set , 2002, Int. J. Comput. Math..

[7] Fred S. Roberts,et al. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..

[8] Alan A. Bertossi,et al. Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[9] Jayme Luiz Szwarcfiter,et al. Some remarks on the geodetic number of a graph , 2010, Discret. Math..