The following pages link to (Q4770409):
Displayed 50 items.
- Harmonics on posets (Q1063047) (← links)
- A class of distance-regular graphs that are \(\phi\)-polynomial (Q1066908) (← links)
- On weakly symmetric graphs of order twice a prime (Q1069953) (← links)
- Hadamard graphs. I (Q1072573) (← links)
- Distance-regular graphs with girth 3 or 4: I (Q1073051) (← links)
- Uniqueness and nonexistence of some graphs related to \(M_{22}\) (Q1075337) (← links)
- An inequality between intersection numbers of a distance-regular graph (Q1075341) (← links)
- On the existence of certain generalized Moore geometries. III (Q1076677) (← links)
- Distance-transitive representations of the symmetric groups (Q1084111) (← links)
- Matroid Steiner problems, the Tutte polynomial and network reliability (Q1088995) (← links)
- On almost nexus semi-symmetric designs (Q1092052) (← links)
- Strong uniform times and finite random walks (Q1094756) (← links)
- The Twenty-fifth International Symposium on Functional Equations, August 16--22, 1987, Hamburg-Rissen, Germany. (Abstracts of the meeting) (Q1100650) (← links)
- Polynomials on graphs (Q1102307) (← links)
- A bound for the complexity of a simple graph (Q1102975) (← links)
- Association schemes and quadratic transformations for orthogonal polynomials (Q1106228) (← links)
- Spanning tree formulas and Chebyshev polynomials (Q1106235) (← links)
- Bounding the diameter of distance. Regular graphs (Q1110534) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Arithmetical graphs (Q1113956) (← links)
- A characterization of \(P\)- and \(Q\)-polynomial association schemes (Q1114694) (← links)
- On distance transitive graphs in which the stabilizer of a point contains an alternating group (Q1114707) (← links)
- Tactical configurations and their generic ring (Q1115448) (← links)
- Properties of graphs with polynomial growth (Q1117947) (← links)
- The degree of the eigenvalues of generalized Moore geometries (Q1119664) (← links)
- Duality in coherent configurations (Q1120579) (← links)
- On the Brauer group of \(k[x_ 1,\dots ,x_ n,1/f]\) (Q1120624) (← links)
- Spectra of categories (Q1125420) (← links)
- On regular graphs, V (Q1133553) (← links)
- On regular graphs, VI (Q1133554) (← links)
- Finite common coverings of pairs of regular graphs (Q1135865) (← links)
- On the spectra of certain distance-regular graphs (Q1136817) (← links)
- Classification of graphs by regularity (Q1137601) (← links)
- Distance transitive digraphs (Q1143406) (← links)
- The smallest graphs with certain adjacency properties (Q1145705) (← links)
- A smallest graph of girth 10 and valency 3 (Q1146692) (← links)
- Feasibility conditions for the existence of walk-regular graphs (Q1148333) (← links)
- Optimal scaling for arbitrarily ordered categories (Q1149715) (← links)
- Chromatic polynomials for regular graphs and modified wheels (Q1150375) (← links)
- A new partial geometry with parameters \((s,t,\alpha)=(7,8,4)\) (Q1156807) (← links)
- The construction of some automorphic graphs (Q1156814) (← links)
- Another example of a finitely presented infinite simple group (Q1156878) (← links)
- Permanental polynomials of graphs (Q1159214) (← links)
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692) (← links)
- Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
- On distance-regularity in graphs (Q1160142) (← links)
- Signed graphs (Q1160198) (← links)
- Locally truncated buildings and M//(24) (Q1160628) (← links)
- A generalization of the matrix-tree theorem (Q1160631) (← links)
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities (Q1163551) (← links)