Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
From MaRDI portal
Publication:2037597
DOI10.1016/j.disc.2021.112519zbMath1467.05141OpenAlexW3175278896MaRDI QIDQ2037597
Publication date: 8 July 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112519
Related Items (2)
Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)] ⋮ \(K_{1, 2}\)-isolation number of claw-free cubic graphs
Cites Work
- Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
- On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph
- Graphs whose neighborhoods have no special cycles
- On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
- On graphs with a constant link. II
- A note on graphs whose neighborhoods are n-cycles
- Isolation of cycles
- Isolation of \(k\)-cliques
- Partial domination of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Graphs with given neighborhoods of vertices
- Partial domination - the isolation number of a graph
- Path-neigborhood graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
