Homomorphisms of strongly regular graphs

DOI10.1016/j.endm.2016.09.047zbMath1356.05156arXiv1601.00969OpenAlexW2963324664MaRDI QIDQ5892300

David E. Roberson

Publication date: 13 February 2017

Published in: Electronic Notes in Discrete Mathematics, Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.00969

zbMATH Keywords

strongly regular graphssemidefinite programminghomomorphismsgraph homomorphismslinear algebraLovász thetacoresLovász theta function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

Endomorphisms of twisted Grassmann graphs ⋮ Endomorphisms and cores of quadratic forms graphs in odd characteristic ⋮ The core of a complementary prism ⋮ Graph homomorphisms via vector colorings ⋮ The core of a vertex-transitive complementary prism ⋮ Two conjectured strengthenings of Turán's theorem ⋮ On Minkowski space and finite geometry ⋮ Nonstandard rank-one nonincreasing maps on symmetric matrices ⋮ Endomorphisms of quadratic forms graph in characteristic two

Uses Software

• SageMath
• Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On endomorphisms of alternating forms graph
• Cores of geometric graphs
• A directed graph version of strongly regular graphs
• Second neighbourhoods of strongly regular graphs
• Strongly regular graphs with smallest eigenvalue -m
• Universal completability, least eigenvalue frameworks, and vector colorings
• Between primitive and 2-transitive: synchronization and its friends
• Graph homomorphisms via vector colorings
• Representations of directed strongly regular graphs
• Approximate graph coloring by semidefinite programming
• A comparison of the Delsarte and Lovász bounds
• On the Shannon capacity of a graph
• CORES OF SYMMETRIC GRAPHS
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II

This page was built for publication: Homomorphisms of strongly regular graphs