scientific article; zbMATH DE number 3878961
From MaRDI portal
Publication:3344016
zbMATH Open0552.05034MaRDI QIDQ3344016FDOQ3344016
Authors: Alexander A. Ivanov 
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)
Cited In (46)
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- Diameter bounds for geometric distance-regular graphs
- Diameter Bounds for Graph Extensions
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Two theorems concerning the Bannai-Ito conjecture
- On distance-regular graphs with \(k_ i= k_ j\). II
- Distance-transitive representations of the symmetric groups
- A unified view of inequalities for distance-regular graphs. I
- Diameter determination on restricted graph families
- Distance-transitive graphs of valency 5, 6 and 7
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- A new family of distance-regular graphs with unbounded diameter
- Walk generating functions and spectral measures of infinite graphs
- Divisors and the spectrum of infinite graphs
- Improving diameter bounds for distance-regular graphs
- The future of Majorana theory
- Distance-transitive representations of groups G with \(PSL_ 2(q)\trianglelefteq G\leq P\Gamma L_ 2(q)\)
- A bound for the diameter of distance-regular graphs
- Title not available (Why is that?)
- Solving boundary value problems on networks using equilibrium measures
- \(k\)-CS-transitive infinite graphs
- On the spectrum and linear programming bound for hypergraphs
- On bounding the diameter of a distance-regular graph
- An improvement of the Ivanov bound
- Central limit theorems for random walks on \({\mathbb{N}}_ 0\) that are associated with orthogonal polynomials
- There are only finitely many distance-regular graphs of fixed valency greater than two
- Bounding the diameter of a distance regular graph by a function of \(k_ d\)
- On distance-regular graphs with fixed valency
- Diameter bounds for planar graphs
- Title not available (Why is that?)
- On distance-regular graphs with fixed valency. II
- On distance-regular graphs with fixed valency. III
- On distance-regular graphs with fixed valency. IV
- Distance-transitive graphs and generalized polygons
- Countable connected-homogeneous graphs
- Distance-regular graphs of valency 6 and \(a_1=1\)
- Title not available (Why is that?)
- Buildings and Hecke algebras.
- Transitivity conditions in infinite graphs
- A remark on the intersection arrays of distance-regular graphs
- Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
- Variations on a theme by Weetman
- Distance regularity in buildings and structure constants in Hecke algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344016)
