On distance-regular graph with strongly regular graphs _2 and _3

DOI10.17377/SEMI.2018.15.017MaRDI QIDQ2285185zbMATH OpenFDO

Authors Marina Sefovna Nirova

Publication date 16 January 2020

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17377/SEMI.2018.15.017

zbMATH Keywords

distance-regular graphgraph with strongly regular \(\Gamma_2\) and \(\Gamma_3\)

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30)

Recommendations

• On antipodal distance-regular graphs with =1
• On Q-polynomial distance-regular graphs with strongly regular graphs _2 and _3
• ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE =1
• Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
• Distance-regular graphs of diameter 3 without triangles with c₂=2

Cites work

• Extremal 1-codes in distance-regular graphs of diameter 3
• scientific article; zbMATH DE number 6084400 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Shilla distance-regular graphs

Cited in

(19)

• Three new distance-regular graphs
• Inverse problems of graph theory: generalized quadrangles
• Inverse problems in the theory of distance-regular graphs: dual 2-designs
• Inverse problems in the theory of distance-regular graphs
• The nonexistence small Q-polynomial graphs of type (III)
• Inverse problems of graph theory: graphs without triangles
• Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
• On Q-polynomial distance-regular graphs with strongly regular graphs _2 and _3
• The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
• On antipodal distance-regular graphs with =1
• Distance-regular graphs with order \((a+1,3)\) and \(c_{r+1}=3,\;a_{r+1}=3a+1\) or \(4a\)
• ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE =1
• On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph
• On distance-regular graphs of diameter 3 with eigenvalue 0
• On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\)
• Graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{3,4}\) is a strongly regular graph with \(\mu=4,6\)
• On codes in distance-regular graphs of diameter 3
• Stoilow factorization of the Heisenberg group
• On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency

This page was built for publication: On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)

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