scientific article; zbMATH DE number 3445271
From MaRDI portal
Publication:4770409
zbMATH Open0284.05101MaRDI QIDQ4770409FDOQ4770409
Authors: Norman L. Biggs
Publication date: 1974
Title of this publication is not available (Why is that?)
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)
- Periodicity of quantum walks defined by mixed paths and mixed cycles
- Cubic graphs and the golden mean
- On the automorphism group of polyhedral graphs
- Graphs on which a dihedral group acts edge-transitively
- On large \((\Delta ,D)\)-graphs
- Gibbsian stationary non-equilibrium states
- Distance-regular graphs in block form
- Interval-regular graphs
- Inverting graphs of rectangular matrices
- The classification of distance-regular graphs of type IIB
- Automorphism groups of self-complementary vertex-transitive graphs
- Martingales and character ratios
- On the number of broadcast schemes in networks
- The Second Immanantal Polynomial and the Centroid of a Graph
- 5-arc transitive cubic Cayley graphs on finite simple groups
- The \(k\)-orbit reconstruction and the orbit algebra
- Graph spectra for finite upper half planes over rings
- Characteristic polynomials of graphs having a semifree action
- On large vertex-symmetric digraphs
- Algebraic graph theory without orientation
- On Laplacian eigenvalues of connected graphs.
- Isomorphism conditions for Cayley graphs of rectangular groups
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- Isomorphisms and automorphisms of graph coverings
- The 4-star graph is not a subgraph of any hypercube
- Betweenness centrality in some classes of graphs
- The effective resistance of the \(N\)-cycle graph with four nearest neighbors
- Some observations on the smallest adjacency eigenvalue of a graph
- On the weighted complexity of a regular covering of a graph
- Counting representable sets on simple graphs
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure
- Arc-transitive cubic Cayley graphs on PSL\((2, p)\)
- Tetravalent half-arc-transitive \(p\)-graphs
- Maximal energy of subdivisions of graphs with a fixed chromatic number
- On middle cube graphs
- The vulnerability of the diameter of folded \(n\)-cubes
- The second eigenvalue of regular graphs of given girth
- On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
- Exact partition functions for the \(q\)-state Potts model with a generalized magnetic field on lattice strip graphs
- Trivalent symmetric graphs of order at most 120
- On the spectra of certain distance-regular graphs
- Tree counting polynomials for labelled graphs. I: Properties
- The partition polynomial of a finite set system
- A fast constrained image segmentation algorithm
- The multiplicities of eigenvalues of a graph
- 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
- Classifying a family of symmetric graphs
- On a graph of ideals
- Tables of large graphs with given degree and diameter
- Polyhedral graphs via their automorphism groups
- Orientably-regular embeddings of a class of multipartite graphs
- Covers of point-hyperplane graphs
- Polynomials on graphs
- Constrained flow control in storage networks: capacity maximization and balancing
- Chromatic polynomials for regular graphs and modified wheels
- Complexity of graph covering problems
- Koszul algebras and flow lattices
- Stability of twisted states in the Kuramoto model on Cayley and random graphs
- Harmonic functions on locally finite networks
- Integral circulant Ramanujan graphs of prime power order
- Locally injective \(k\)-colourings of planar graphs
- Cauchy-Binet for pseudo-determinants
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- On the spectrum of an extremal graph with four eigenvalues
- Stability of dynamical networks with non-identical nodes: a multiple \(V\)-Lyapunov function method
- \(Z_3\)-connectivity of wreath product of graphs
- A generalization of Boesch's theorem
- Six signed Petersen graphs, and their automorphisms
- A bound for the complexity of a simple graph
- Dual concepts of almost distance-regularity and the spectral excess theorem
- Geometric aspects of 2-walk-regular graphs
- On distance-regularity in graphs
- Automorphism groups of symmetric graphs of valency 3
- Tetravalent edge-transitive graphs of order \(p^2q\)
- Characterizing \((\ell ,m)\)-walk-regular graphs
- Three-class association schemes
- On the average rank of an element in a filter of the partition lattice
- On the Brauer group of \(k[x_ 1,\dots ,x_ n,1/f]\)
- On the girth of infinite graphs
- Vertex-transitive expansions of (1, 3)-trees
- A new condition for distance-regular graphs
- The limit of chromatic polynomials
- On the point stabilizers of transitive groups with non-self-paired suborbits of length 2
- Uniform emulations of Cartesian-product and Cayley graphs
- The eigenvalues of the Laplacian on locally finite networks
- On several symmetry conditions for graphs
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- Eigenvalue interlacing and weight parameters of graphs
- Calculations of level probabilities for normal random variables with unequal variances with applications to Bartholomew's test in unbalanced one-way models.
- Distance-regular graphs with girth 3 or 4: I
- Hadamard graphs. I
- On isomorphisms of connected Cayley graphs
- Covering regular graphs
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- A family of Cayley graphs on the hexavalent grid
- The distance-regular graphs of valency four
- Non-normal one-regular and 4-valent Cayley graphs of dihedral groups \(D_{2n}\)
- On the characterization of graphs with maximum number of spanning trees
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)