scientific article; zbMATH DE number 3445271

Publication date 1974

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Graph theory (05Cxx)

Cited in

(only showing first 100 items - show all)

The hierarchical product of graphs
Generalized thrackle drawings of non-bipartite graphs
Regular partitions of (weak) finite generalized polygons
A combinatorial proof of the removal lemma for groups
On large vertex-symmetric digraphs
On the first group of the chromatic cohomology of graphs
Interconnection networks for parallel molecular dynamics simulation based on Hamiltonian cubic symmetric topology
The generalized hierarchical product of graphs
On the characteristic and Laplacian polynomials of trees
Generalized n-gons and Chebyshev polynomials
The sextet construction for cubic graphs
Girths of bipartite sextet graphs
Distance-biregular graphs with 2-valent vertices and distance regular line graphs
Distance-transitive graphs and generalized polygons
Harmonics on posets
A class of distance-regular graphs that are \(\phi\)-polynomial
On weakly symmetric graphs of order twice a prime
Hadamard graphs. I
Distance-regular graphs with girth 3 or 4: I
Uniqueness and nonexistence of some graphs related to \(M_{22}\)
An inequality between intersection numbers of a distance-regular graph
On the existence of certain generalized Moore geometries. III
Distance-transitive representations of the symmetric groups
Matroid Steiner problems, the Tutte polynomial and network reliability
On almost nexus semi-symmetric designs
Strong uniform times and finite random walks
The Twenty-fifth International Symposium on Functional Equations, August 16--22, 1987, Hamburg-Rissen, Germany. (Abstracts of the meeting)
Polynomials on graphs
A bound for the complexity of a simple graph
Association schemes and quadratic transformations for orthogonal polynomials
Spanning tree formulas and Chebyshev polynomials
Bounding the diameter of distance. Regular graphs
Eigenvalues and expanders
Arithmetical graphs
A characterization of \(P\)- and \(Q\)-polynomial association schemes
On distance transitive graphs in which the stabilizer of a point contains an alternating group
Tactical configurations and their generic ring
Properties of graphs with polynomial growth
The degree of the eigenvalues of generalized Moore geometries
Duality in coherent configurations
On the Brauer group of \(k[x_ 1,\dots ,x_ n,1/f]\)
Spectra of categories
On regular graphs, V
On regular graphs, VI
Finite common coverings of pairs of regular graphs
On the spectra of certain distance-regular graphs
Classification of graphs by regularity
Distance transitive digraphs
The smallest graphs with certain adjacency properties
A smallest graph of girth 10 and valency 3
Feasibility conditions for the existence of walk-regular graphs
Optimal scaling for arbitrarily ordered categories
Chromatic polynomials for regular graphs and modified wheels
A new partial geometry with parameters (s,t,)=(7,8,4)
The construction of some automorphic graphs
Another example of a finitely presented infinite simple group
Permanental polynomials of graphs
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
Tree counting polynomials for labelled graphs. I: Properties
On distance-regularity in graphs
Signed graphs
Locally truncated buildings and M//(24)
A generalization of the matrix-tree theorem
Two combinatorial applications of the Aleksandrov-Fenchel inequalities
Star-transitive graphs
Tables of large graphs with given degree and diameter
The diameter of bipartite distance-regular graphs
On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
On the existence of certain distance-regular graphs
Equiarboreal graphs
On the Brauer group of surfaces
Infinite distance transitive graphs of finite valency
Characterization of the odd graphs \(O_ k \)by parameters
Eigenvalue multiplicities of highly symmetric graphs
On the complexity of a hypermap
The partition polynomial of a finite set system
On the geometry and Laplacian of a graph
Orientation of signed graphs
The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
On an infinite class of non-bipartite and non-Cayley graphs having 2-arc transitive automorphism groups
Bounding the diameter of a distance regular graph by a function of \(k_ d\)
A finite group attached to the laplacian of a graph
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
Isomorphisms and automorphisms of graph coverings
A new condition for distance-regular graphs
Automorphisms of Cayley graphs
On the Brauer group of a localization
Spectra of regular polytopes
A survey on graphs with polynomial growth
On several symmetry conditions for graphs
Unimodular equivalence of graphs
Graphs with polynomial growth are covering graphs
Diameters of cubic graphs
The k-orbit reconstruction and the orbit algebra
On the \(p\)-rank of incidence matrices and a bound of Bruen and Ott
Distance regular covers of the complete graph
The 4-star graph is not a subgraph of any hypercube
The rotor effect can alter the chromatic polynomial
Spectra of Cayley graphs
An upper bound for the number of spanning trees of a graph

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 Q4770409)