Graphs with isolation number equal to one third of the order
From MaRDI portal
Recommendations
Cites work
- Domination-balanced graphs
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Isolation of \(k\)-cliques
- Isolation of \(k\)-cliques. II
- Isolation of cycles
- On graphs having domination number half their order
- Partial domination -- the isolation number of a graph
Cited in
(17)- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- Disjoint isolating sets and graphs with maximum isolation number
- \(k\)-isolation in graphs
- A note on the \(P_3\)-isolation number of a graph
- Solution to a 3-path isolation problem for subcubic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- Total isolation of k-cliques in a graph
- A characterization of graphs with maximum k-clique isolation number
- Proof of a conjecture on isolation of graphs dominated by a vertex
- On total isolation in graphs
- A characterization of graphs with maximum cycle isolation number
- Proof of a conjecture on isolation of cycles in graphs
- Upper bounds on the k-isolation number
- Solution to a problem on isolation of 3-vertex paths
- Isolation of non-triangle cycles in graphs
- Graphs with total isolation number equal to half the order
- Bounds on the game isolation number and exact values for paths and cycles
This page was built for publication: Graphs with isolation number equal to one third of the order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204326)
