Embedding arbitrary finite simple graphs into small strongly regular graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200005)34:1<1::AID-JGT1>3.0.CO;2-E" /><1::AID-JGT1>3.0.CO;2-E 10.1002/(SICI)1097-0118(200005)34:1<1::AID-JGT1>3.0.CO;2-EzbMath0947.05089OpenAlexW4245474313MaRDI QIDQ4487070

Jajcay, Robert, Dale M. Mesner

Publication date: 5 November 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1<1::aid-jgt1>3.0.co;2-e

zbMATH Keywords

strongly regular graphsinduced subgraph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

A partial refining of the Erdős-Kelly regulation ⋮ Inducing regulation of any digraphs

Cites Work

• Sidon sets in groups and induced subgraphs of Cayley graphs
• Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
• Paley graphs satisfy all first-order adjacency axioms
• On the embedding of graphs into graphs with few eigenvalues
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: Embedding arbitrary finite simple graphs into small strongly regular graphs