Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist (Q2633389): Difference between revisions

@@ Property / author @@
+Ivan Nikolaevich Belousov
@@ Property / author: Ivan Nikolaevich Belousov / rank @@
+Normal rank
@@ Property / author @@
+Aleksandr Alekseevich Makhnev
@@ Property / author: Aleksandr Alekseevich Makhnev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.33048/semi.2018.15.125
+Normal rank
@@ Property / OpenAlex ID @@
+W3015558647
@@ Property / OpenAlex ID: W3015558647 / rank @@
+Normal rank
@@ Property / cites work @@
+Shilla distance-regular graphs
@@ Property / cites work: Shilla distance-regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On automorphisms of distance-regular graph with intersection array \(\{15, 12, 6; 1, 2, 10\}\)
+Normal rank
@@ Property / cites work @@
+Q4594203
@@ Property / cites work: Q4594203 / rank @@
+Normal rank
@@ Property / cites work @@
+Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)
+Normal rank
@@ Property / cites work @@
+Extremal 1-codes in distance-regular graphs of diameter 3
+Normal rank