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

DOI10.1007/s40314-024-02816-1MaRDI QIDQ6569097

Baoyindureng Wu, Bo Zhang

Publication date: 8 July 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphregular graphneighborhoodTrahtenbrot-Zykov problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

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\)]
• Graphs \(G\) in which \(G-N[v\) has a prescribed property 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
• Extensions of the Art Gallery Theorem
• 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\) where \(G-N[v]\) is a regular graph for each vertex \(v\)