Graphs G where G-N[v] is a tree for each vertex v

DOI10.1007/S00373-024-02814-4MaRDI QIDQ6581900zbMATH OpenFDO

Authors Bo Zhang, Baoyindureng Wu

Publication date 1 August 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

treecliquepathstarTrahtenbrot-Zykov problem

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• scientific article; zbMATH DE number 4103126
• Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
• scientific article; zbMATH DE number 90531

Cites work

• scientific article; zbMATH DE number 4130425 (Why is no real title available?)
• scientific article; zbMATH DE number 6096647 (Why is no real title available?)
• scientific article; zbMATH DE number 4085709 (Why is no real title available?)
• scientific article; zbMATH DE number 3675952 (Why is no real title available?)
• scientific article; zbMATH DE number 15465 (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 \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
• Graphs whose neighborhoods have no special cycles
• Graphs with given neighborhoods of vertices
• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• Isolation number of maximal outerplanar graphs
• Isolation of \(k\)-cliques
• Isolation of cycles
• On extremal sizes of locally \(k\)-tree graphs.
• 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
• The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph

Cited in

(1)

• Graphs \(G\) where \(G-N[v]\) is a regular graph for each vertex \(v\)

This page was built for publication: Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581900)