Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
type: Item
instance of: scholarly article
title: Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
zbMATH Open document ID: 1467.05141
author: Huijuan Yu
author: Baoyindureng Wu
published in: Discrete Mathematics
publication date: 2021-07-08T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7369647
zbMATH Keywords: complement
zbMATH Keywords: cycle
zbMATH Keywords: neighborhood
zbMATH Keywords: line graphs
zbMATH Keywords: Petersen graph
zbMATH Keywords: triangle-free cubic graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112519
OpenAlex ID: W3175278896
cites work: Graphs with given neighborhoods of vertices
cites work: Q5422499
cites work: Isolation of cycles
cites work: Isolation of \(k\)-cliques
cites work: Partial domination of maximal outerplanar graphs
cites work: Graphs whose neighborhoods have no special cycles
cites work: Q5672654
cites work: On graphs with a constant link. II
cites work: Q4017167
cites work: Partial domination - the isolation number of a graph
cites work: A note on graphs whose neighborhoods are n-cycles
cites work: Terwilliger graphs in which the neighborhood of some vertex is isomorphic to a Petersen graph
cites work: On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph
cites work: Q4200107
cites work: On graphs in which the neighborhood of each vertex is isomorphic to the Higman-Sims graph
cites work: Path-neigborhood graphs
cites work: Q3166108
cites work: Isolation number of maximal outerplanar graphs
cites work: Q5527633
DOI: 10.1016/J.DISC.2021.112519
description: scientific article; zbMATH DE number 7369647