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)

Complete rotations in Cayley graphs
Koszul algebras and flow lattices
Covering regular graphs
A note on the zeta function of a graph
Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
Automorphism groups of symmetric graphs of valency 3
Tree connectivities of Cayley graphs on abelian groups with small degrees
3-colorability and forbidden subgraphs. I: Characterizing pairs
Stability of twisted states in the Kuramoto model on Cayley and random graphs
Tetravalent edge-transitive graphs of order \(p^2q\)
Asymptotic enumeration of vertex-transitive graphs of fixed valency
The regular near polygons of order \((s,2)\)
Uniform emulations of Cartesian-product and Cayley graphs
On the Brauer group of \(k[x_ 1,\dots ,x_ n,1/f]\)
Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models
A unified method for eigendecomposition of graph products
Distance regular covers of the complete graph
Stability of dynamical networks with non-identical nodes: a multiple \(V\)-Lyapunov function method
The eigenvalues of the Laplacian on locally finite networks
Spectra of Extended Double Cover Graphs
On the girth of infinite graphs
REDUCTION OF DISCRETE DYNAMICAL SYSTEMS OVER GRAPHS
\(Z_3\)-connectivity of wreath product of graphs
A family of Cayley graphs on the hexavalent grid
A generalization of Boesch's theorem
The distance-regular graphs of valency four
Finite edge-transitive Cayley graphs and rotary Cayley maps
Six signed Petersen graphs, and their automorphisms
The parameters of bipartite \(Q\)-polynomial distance-regular graphs
Integral circulant Ramanujan graphs of prime power order
Feasibility conditions for the existence of walk-regular graphs
On the spectrum of an extremal graph with four eigenvalues
Locally injective \(k\)-colourings of planar graphs
Cauchy-Binet for pseudo-determinants
Regular partitions of (weak) finite generalized polygons
Relative elementary abelian groups and a class of edge-transitive Cayley graphs
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
Graph complexity and the laplacian matrix in blocked experiments
Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees
Completely O-simple semigroups and their associated graphs and groups
Vertex-transitive expansions of (1, 3)-trees
Eigenvalue interlacing and weight parameters of graphs
On Invariants of Graphs with Applications to Knot Theory
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
Bipartite graphs and digraphs with maximum connectivity
A combinatorial proof of the removal lemma for groups
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
A bound for the complexity of a simple graph
On bi-regular cages of even girth at least 8
Harmonic functions on locally finite networks
Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
A new condition for distance-regular graphs
Non-normal one-regular and 4-valent Cayley graphs of dihedral groups \(D_{2n}\)
Clique-inserted-graphs and spectral dynamics of clique-inserting
Locally constrained graph homomorphisms and equitable partitions
Dual concepts of almost distance-regularity and the spectral excess theorem
Perfect codes and regular partitions in graphs and groups
Hulls of codes from incidence matrices of connected regular graphs
On the symmetries of some classes of recursive circulant graphs
The spectral excess theorem for distance-biregular graphs.
On cubic \(s\)-arc transitive Cayley graphs of finite simple groups
Characterizing \((\ell ,m)\)-walk-regular graphs
Enumeration of graphs with the same Ihara zeta function
Three-class association schemes
On several symmetry conditions for graphs
Geometric aspects of 2-walk-regular graphs
Calculations of level probabilities for normal random variables with unequal variances with applications to Bartholomew's test in unbalanced one-way models.
An age-structured multi-strain epidemic model for antigenically diverse infectious diseases: a multi-locus framework
The limit of chromatic polynomials
Infinite distance transitive graphs of finite valency
Finite vertex-primitive edge-transitive metacirculants.
Edge-transitivity of Cayley graphs generated by transpositions
scientific article; zbMATH DE number 7255560 (Why is no real title available?)
On the characterization of graphs with maximum number of spanning trees
Almost-bipartite distance-regular graphs with the \(Q\)-polynomial property
On the average rank of an element in a filter of the partition lattice
On distance-regularity in graphs
An upper bound for the number of spanning trees of a graph
Distance-regular graphs with girth 3 or 4: I
Hadamard graphs. I
On the point stabilizers of transitive groups with non-self-paired suborbits of length 2
On combinatorial properties of bands
Regular homomorphisms and regular maps
On Cayley graphs of some semigroups
Bicycles and Spanning Trees
On the first group of the chromatic cohomology of graphs
On isomorphisms of connected Cayley graphs
Unitary graphs
Distance-regular graphs in block form
Gibbsian stationary non-equilibrium states
Betweenness centrality in some classes of graphs
The effective resistance of the \(N\)-cycle graph with four nearest neighbors
Tree counting polynomials for labelled graphs. I: Properties
Algebraic graph theory without orientation
Martingales and character ratios
The \(k\)-orbit reconstruction and the orbit algebra
The partition polynomial of a finite set system
A fast constrained image segmentation algorithm
Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
On the uniqueness of the graphs G(n,k) of the Johnson schemes

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)