New PDF release: Distance-Regular Graphs

By Andries E. Brouwer, Arjeh M. Cohen, Arnold Neumaier (auth.)

ISBN-10: 3642743412

ISBN-13: 9783642743412

ISBN-10: 3642743439

ISBN-13: 9783642743436

Ever because the discovery of the 5 platonic solids in precedent days, the examine of symmetry and regularity has been some of the most attention-grabbing points of arithmetic. regularly the arithmetical regularity houses of an item suggest its distinctiveness and the life of many symmetries. This interaction among regularity and symmetry houses of graphs is the subject matter of this ebook. ranging from very basic regularity houses, the concept that of a distance-regular graph arises clearly as a typical environment for normal graphs that are extremal in a single experience or one other. numerous different very important general combinatorial constructions are then proven to be such as distinct households of distance-regular graphs. different matters of extra normal curiosity, equivalent to regularity and extremal houses in graphs, organization schemes, representations of graphs in euclidean area, teams and geometries of Lie variety, teams performing on graphs, and codes are coated independently. Many new effects and proofs and greater than 750 references raise the encyclopaedic price of this book.

Show description

Read or Download Distance-Regular Graphs PDF

Similar linear programming books

Goran Peskir, Albert N. Shiryaev's Optimal Stopping and Free-Boundary Problems PDF

The publication goals at disclosing a desirable connection among optimum preventing difficulties in chance and free-boundary difficulties in research utilizing minimum instruments and targeting key examples. the overall idea of optimum preventing is uncovered on the point of easy ideas in either discrete and non-stop time overlaying martingale and Markovian equipment.

Download e-book for kindle: Linear Programming and Extensions by George Dantzig

In real-world difficulties relating to finance, enterprise, and administration, mathematicians and economists usually stumble upon optimization difficulties. First released in 1963, this vintage paintings seems at a wealth of examples and develops linear programming tools for recommendations. remedies coated comprise expense thoughts, transportation difficulties, matrix tools, and the houses of convex units and linear vector areas.

Download e-book for kindle: Short-Memory Linear Processes and Econometric Applications by Kairat T. Mynbaev

This booklet serves as a entire resource of asymptotic effects for econometric types with deterministic exogenous regressors. Such regressors contain linear (more mostly, piece-wise polynomial) tendencies, seasonally oscillating features, and slowly various services together with logarithmic traits, in addition to a few necessities of spatial matrices within the concept of spatial versions.

Read e-book online Robust Discrete Optimization and Its Applications PDF

This e-book offers with determination making in environments of important facts un­ sure bet, with specific emphasis on operations and creation administration functions. For such environments, we recommend using the robustness ap­ proach to selection making, which assumes insufficient wisdom of the choice maker concerning the random kingdom of nature and develops a call that hedges opposed to the worst contingency which could come up.

Extra info for Distance-Regular Graphs

Sample text

Special Regular Graphs precisely n /4 places. Thus, either n Eo;; 2 or n is divisible by 4. The case n Eo;; 2 is trivial. It is a long-standing conjecture that Hadamard matrices exist for all orders n 0 (mod 4). , for n = 4m < 428 and for n = 23 m with m 2 Eo;; '):'; see WALLIS, STREET & WALLIS [768], SEBERRY [767], GERAMITA & SEBERRY [322] and the survey article of HEDAYAT & WALLIS [367] for the many known construction techniques and SAWADE [637] for the current state of knowledge. 1. Theorem (DRAKE [271], SHAD [662], DELORME [246]).

This result and the well-known classification of all finite generalized quadrangles with line size 3 is the content of the theorem below. Recall that a generalized quadrangle is a partial linear space such that if x is a point not on a line I, then x is collinear with a unique point of I. It is called degenerate if some point is collinear with all other points. Thus, in a degenerate generalized quadrangle the set of lines forms a pencil. Write Lx for the set of lines on x. One easily sees that if x and y are noncollinear, then 1Lx 1 = 1Ly I.

A bipartite graph with v vertices is distance-regular of diameter d = 3 (with intersection array {k, k -1, k - 1-'; 1,1-', k}) if and only if it is the incidence graph of a square 2-design (with parameters 2-(w,k,I-'), where k > 1 and w = = I+k(k-I)/I-'). tv Proof. Let X I and X 2 be the parts of a bipartite distance-regular graph f of diameter 3. Interpret the adjacency relation of f as incidence on Xl XX 2 • It is obvious that this defines a square 2-design with the stated parameters. The converse also holds as any two blocks of a square 2-(w,k, 1-') design meet in exactly I-' points of the design.

Download PDF sample

Distance-Regular Graphs by Andries E. Brouwer, Arjeh M. Cohen, Arnold Neumaier (auth.)

by Brian

Rated 4.57 of 5 – based on 5 votes