Classification of small (0, 2)-graphs

13 years 4 months ago

Download www.win.tue.nl

We find the graphs of valency at most 7 with the property that any two nonadjacent vertices have either 0 or 2 common neighbours. In particular, we find all semibiplanes of block size at most 7.

Andries E. Brouwer

Real-time Traffic

Common Neighbours | JCT 2006 | Nonadjacent Vertices |

claim paper

» Law of the Iterated Logarithm for a ConstantGain Linear Stochastic Gradient Algorithm

» Voice attributes affecting likability perception

» Distributed classification in peertopeer networks

» Rough Set Theory of Pattern Classification in the Brain

» Scattering in Flatland Efficient Representations via Wave Atoms

» Optimizing noncontiguous accesses in MPIIO

» Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

» An Efficient Alternative to SVM Based Recursive Feature Elimination with Applications in N...

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Andries E. Brouwer

Comments (0)

Sciweavers

Classification of small (0, 2)-graphs

Common Neighbours | JCT 2006 | Nonadjacent Vertices |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers