On the geodetic number of complementary prisms

DOI10.1016/J.IPL.2018.12.007MaRDI QIDQ1721934zbMATH OpenOpenAlexFDO

Authors Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento

Publication date 13 February 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.12.007

zbMATH Keywords

combinatorial problemscomplementary prismcomputational complexitygeodetic convexitygeodetic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Recommendations

• A note on the convexity number for complementary prisms
• Some remarks on the geodetic number of a graph
• A polynomial time algorithm for geodetic hull number for complementary prisms
• The geodetic hop domination number of complementary prisms
• Complexity properties of complementary prisms

Cites work

• Computational Complexity of Geodetic Set
• Dominating sets for split and bipartite graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Local majorities, coalitions and monopolies in graphs: A review
• On the geodetic hull number of \(P_{k}\)-free graphs
• On the geodetic number of a graph
• Recognizing some complementary products
• Some remarks on the geodetic number of a graph
• The complementary product of two graphs

Cited in

(11)

• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
• \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
• Geodetic number of powers of cycles
• On the General Position Number of Complementary Prisms
• On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs
• The geodetic hop domination number of complementary prisms
• A polynomial time algorithm for geodetic hull number for complementary prisms
• A note on the convexity number for complementary prisms
• Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• The core of a complementary prism

This page was built for publication: On the geodetic number of complementary prisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721934)