Searching for square-complementary graphs: complexity of recognition and further nonexistence results

From MaRDI portal
Publication:2022157



Abstract: A graph is square-complementary (squco, for short) if its square and complement are isomorphic. We prove that there are no squco graphs with girth 6, that every bipartite graph is an induced subgraph of a squco bipartite graph, that the problem of recognizing squco graphs is graph isomorphism complete, and that no nontrivial squco graph is both bipartite and planar. These results resolve three of the open problems posed in Discrete Math. 327 (2014) 62-75.





Describes a project that uses

Uses Software






This page was built for publication: Searching for square-complementary graphs: complexity of recognition and further nonexistence results

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