Graphs in which G - N[v] is a cycle for each vertex v
From MaRDI portal
Publication:2037597
Recommendations
Cites work
- scientific article; zbMATH DE number 6096647 (Why is no real title available?)
- scientific article; zbMATH DE number 91024 (Why is no real title available?)
- scientific article; zbMATH DE number 3641494 (Why is no real title available?)
- scientific article; zbMATH DE number 3240227 (Why is no real title available?)
- scientific article; zbMATH DE number 3407695 (Why is no real title available?)
- A note on graphs whose neighborhoods are n-cycles
- Graph theory
- Graphs whose neighborhoods have no special cycles
- Graphs with given neighborhoods of vertices
- Isolation number of maximal outerplanar graphs
- Isolation of \(k\)-cliques
- Isolation of cycles
- On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
- On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph
- On graphs with a constant link. II
- Partial domination -- the isolation number of a graph
- Partial domination of maximal outerplanar graphs
- Path-neighborhood graphs
- Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
Cited in
(6)- scientific article; zbMATH DE number 3926963 (Why is no real title available?)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Some locally Kneser graphs
This page was built for publication: Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037597)
