A note on the convexity number for complementary prisms
zbMATH Open1417.05045arXiv1809.08220MaRDI QIDQ5226848FDOQ5226848
Authors: Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1809.08220
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Distance in graphs (05C12)
Cited In (11)
- On the geodetic number of complementary prisms
- On the monophonic convexity in complementary prisms
- On the General Position Number of Complementary Prisms
- Geometric and topological properties of the complementary prism networks
- Remarks on \(k\)-clique, \(k\)-independent set and 2-contamination in complementary prisms
- A note on the convexity number of the complementary prisms of trees
- A polynomial time algorithm for geodetic hull number for complementary prisms
- The core of a complementary prism
- The core of a vertex-transitive complementary prism
- On the geodetic hull number for complementary prisms. II.
- Complexity properties of complementary prisms
This page was built for publication: A note on the convexity number for complementary prisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226848)