Titlebook: Distance-Regular Graphs; Andries E. Brouwer,Arjeh M. Cohen,Arnold Neumaier Book 1989 Springer-Verlag Berlin Heidelberg 1989 Arithmetic.Lie

中產(chǎn)階級

書目名稱Distance-Regular Graphs影響因子(影響力)




書目名稱Distance-Regular Graphs影響因子(影響力)學(xué)科排名




書目名稱Distance-Regular Graphs網(wǎng)絡(luò)公開度




書目名稱Distance-Regular Graphs網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Distance-Regular Graphs被引頻次




書目名稱Distance-Regular Graphs被引頻次學(xué)科排名




書目名稱Distance-Regular Graphs年度引用




書目名稱Distance-Regular Graphs年度引用學(xué)科排名




書目名稱Distance-Regular Graphs讀者反饋




書目名稱Distance-Regular Graphs讀者反饋學(xué)科排名

率直

Complement

Theory of Distance-Regular Graphs,parts of the theory of distance-regular graphs independently of Chapter 2, we shall use concepts and results about association schemes for more specialized topics such as .-polynomial orderings (Chapter 8) and codes in graphs (Chapter 11). In §4.2 we look at various constructions that, given a dista

欄桿

Parameter Restrictions for Distance-Regular Graphs,y been mentioned in §4.1D.) Some of these restrictions are important tools in the theoretical investigation of the properties of distance-regular graphs, like the unimodality of the sequence (.). discussed in §5.1. (We already used this on several occasions.) Various bounds on the diameter in terms

神刊

Carbon-Monoxide

Graphs of Coxeter and Lie Type,In the later sections almost all known infinite families of distance-transitive graphs are described in this framework. The chapter ends with a determination of all distance-transitive graphs which naturally arise from a Tits system in a finite Chevalley group. Much more information on Tits systems,

Carbon-Monoxide

Graphs Related to Codes, .). We define the . Γ(.) . by taking as vertices the cosets of . in ., and joining two cosets when they have representatives that differ in one coordinate (i.e., have Hamming distance one). In some cases Γ(.) turns out to be distance-regular. In section 11.1 we study this phenomenon in a more gener

設(shè)施

dilute

Tables of Parameters for Distance Regular Graphs,regular graphs with diameter 4 on at most 4096 vertices, and for arbitrary distance-regular graphs of diameter at least 5 on at most 4096 vertices. In each category the parameter sets are ordered by . (not .). We only list intersectiòn arrays that pass all feasibility criteria known to us. We do not

防水

0071-1136 ting aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. This interplay between regularity and symmetry properties of graphs is the theme of this book. Starting from very elementary regularity properties,