There is no (75,32,10,16) strongly regular graph
نویسندگان
چکیده
منابع مشابه
On the Strongly Regular Graph of Parameters
In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we studied its possible substructure and constructions.
متن کاملThere is no universal countable pentagon-free graph
No countable C,-free graph contains every countable C,-free graph as a subgraph, for n 2 4. For n = 4, this was proved earlier by J. Pach.
متن کاملThere is no universal countable random-free graph
We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.
متن کاملThere is no lexicon!
0. Introduction Within generative linguistics, underlying representations have been a sine qua non. Such representations have been thought to encode what is unpredictable or not governed by rules. Within Optimality Theory (henceforth OT), even though the rules are virtually gone, this view continues. The function GEN and EVAL pair an underlying representation with an optimal output. I argue aga...
متن کاملClassification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2018
ISSN: 0024-3795
DOI: 10.1016/j.laa.2018.07.019