Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
From MaRDI portal
Publication:2146735
DOI10.1016/j.dam.2022.04.023zbMath1491.05149OpenAlexW4281690451WikidataQ113877210 ScholiaQ113877210MaRDI QIDQ2146735
Publication date: 21 June 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.04.023
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
- 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
- Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)]
- Isolation of cycles
- Isolation of \(k\)-cliques
- Partial domination of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Graphs with given neighborhoods of vertices
- On extremal sizes of locally k-tree graphs
- Partial domination - the isolation number of a graph
- Path-neigborhood graphs
This page was built for publication: Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
