منابع مشابه
Strongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملHamiltonian strongly regular graphs
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected nonHamiltonian strongly regular graph on fewer than 99 vertices.
متن کاملRandom strongly regular graphs?
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...
متن کاملDistance-Regular Graphs with Strongly Regular Subconstituents
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1975
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90057-6