Embedding arbitrary finite simple graphs into small strongly regular graphs

DOI10.1002/(SICI)1097-0118(200005)34:1%3C1::AID-JGT1%3E3.0.CO;2-EMaRDI QIDQ4487070zbMATH OpenOpenAlexFDO

Authors Robert Jajcay, Dale M. Mesner

Publication date 5 November 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200005)34:1%3C1::aid-jgt1%3E3.0.co;2-e

zbMATH Keywords

induced subgraphstrongly regular graphs

Mathematics Subject Classification ID

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

Recommendations

• Embedding arbitrary graphs into strongly regular and distance-regular graphs
• Graphs embedded into finite projective planes
• Bounded complete embedding graphs
• A strongly regular \(n\)-full graph of small order
• scientific article; zbMATH DE number 683300

Cites work

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

Cited in

(6)

• Inducing regulation of any digraphs
• Embedding digraphs of small size
• Embedding arbitrary graphs into strongly regular and distance-regular graphs
• On strongly almost trivial embeddings of graphs
• scientific article; zbMATH DE number 683300 (Why is no real title available?)
• A partial refining of the Erdős-Kelly regulation

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

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