Graphs in which G - N[v] is a cycle for each vertex v
From MaRDI portal
Publication:2037597
DOI10.1016/J.DISC.2021.112519zbMATH Open1467.05141OpenAlexW3175278896MaRDI QIDQ2037597FDOQ2037597
Authors: Huijuan Yu, Baoyindureng Wu 
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
Recommendations
Cites Work
- Graph theory
- Title not available (Why is that?)
- Graphs whose neighborhoods have no special 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
- Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
- Title not available (Why is that?)
- Isolation number of maximal outerplanar graphs
- Partial domination of maximal outerplanar graphs
- Title not available (Why is that?)
- On graphs with a constant link. II
- A note on graphs whose neighborhoods are n-cycles
- Isolation of cycles
- Isolation of \(k\)-cliques
- Graphs with given neighborhoods of vertices
- Title not available (Why is that?)
- Partial domination -- the isolation number of a graph
- Path-neighborhood graphs
- Title not available (Why is that?)
Cited In (6)
- Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
- Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Title not available (Why is that?)
- Some locally Kneser graphs
- \(K_{1, 2}\)-isolation number of claw-free cubic 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)
