Pages that link to "Item:Q511681"
From MaRDI portal
The following pages link to Complexity properties of complementary prisms (Q511681):
Displayed 16 items.
- Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs (Q1638005) (← links)
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
- Open-independent, open-locating-dominating sets in complementary prism graphs (Q2132352) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- A general framework for path convexities (Q2156285) (← links)
- A note on the convexity number of the complementary prisms of trees (Q2161269) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- On the General Position Number of Complementary Prisms (Q4989178) (← links)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
- Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms (Q5859672) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- The core of a complementary prism (Q6083960) (← links)
- The core of a vertex-transitive complementary prism (Q6111258) (← links)
- Geometric and topological properties of the complementary prism networks (Q6179908) (← links)