On the geodetic number of complementary prisms

DOI10.1016/j.ipl.2018.12.007zbMath1481.05039OpenAlexW2883134411MaRDI QIDQ1721934

Hebert Coelho, Diane Castonguay, Erika M. M. 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

computational complexitycombinatorial problemsgeodetic numbergeodetic convexitycomplementary prism

Mathematics Subject Classification ID

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

Related Items (7)

\(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ The core of a complementary prism ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms ⋮ On the vertex monophonic, vertex geodetic and vertex Steiner numbers of graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs ⋮ The geodetic hop domination number of complementary prisms

Cites Work

• Unnamed Item
• Recognizing some complementary products
• Dominating sets for split and bipartite graphs
• Some remarks on the geodetic number of a graph
• 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
• Computational Complexity of Geodetic Set

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