Skip to search formSkip to main contentSkip to account menu
Spectra of Graphs
TLDR
This book gives an elementary treatment of the basic material about graph Spectra, both for ordinary, and Laplace and Seidel spectra, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics.
View via Publisher
Distance Regular Graphs
Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in…
View via Publisher
A new table of constant weight codes
TLDR
The known techniques for constructing constant weight codes are surveyed, and a table of (unrestricted) binary codes of length nl28 is given.
View via Publisher
Bounds on the size of linear codes
The structure of near polygons with quads
We develop a structure theory for near polygons with quads. Main results are the existence of sub 2j-gons for 2⩽j⩽d and the nonexistence of regular sporadic 2d-gons for d⩾4 with s>1 and t2>1 and…
View on Springer
Eigenvalues and perfect matchings
View via Publisher
The Blocking Number of an Affine Space
View via Publisher
Contractibility and NP-completeness
TLDR
The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4, which is NP-complete if H is a connected triangle-free graph other than a star.
View via Publisher
The graphs with spectral radius between 2 and 2+5
View via Publisher
Association schemes
From the combination of knowledge and actions, someone can improve their skill and ability. It will lead them to live and work much better. This is why, the students, workers, or even employers…
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License