arXiv Analytics

Sign in

arXiv:2409.00268 [math.CO]AbstractReferencesReviewsResources

Uniform Shared Neighborhood Structures in Edge-Regular Graphs

Jared DeLeo

Published 2024-08-30Version 1

A shared neighborhood structure (SNS) in a graph is a subgraph induced by the intersection of the open neighbor sets of two adjacent vertices. If a SNS is the same for all adjacent vertices in an edge-regular graph, call the SNS a uniform shared neighborhood structure (USNS). USNS-forbidden graphs (graphs which cannot be a USNS of an edge-regular graph) and USNS in graph products of edge-regular graphs are examined.

Related articles: Most relevant | Search more
arXiv:1810.07454 [math.CO] (Published 2018-10-17)
Another construction of edge-regular graphs with regular cliques
arXiv:1801.07025 [math.CO] (Published 2018-01-22)
Spanning trees without adjacent vertices of degree 2
arXiv:2107.00424 [math.CO] (Published 2021-07-01)
A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs