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
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions
- Eigenvalues and expanders
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- Coloured graphical models and their symmetries
- Cubic symmetric graphs of order twice an odd prime-power
- New largest known graphs of diameter 6
- Adjacency preservers on invertible Hermitian matrices. I.
- Adjacency preservers, symmetric matrices, and cores
- Quantum simulations of classical random walks and undirected graph connectivity
- The degree-diameter problem for sparse graph classes
- Some remarks on Laplacian eigenvalues of connected graphs
- Signed graphs
- Smith normal form and Laplacians
- Distance regular subgraphs of a cube
- The Broken-Circuit Complex
- Transitive Graphs With Fewer Than Twenty Vertices
- Symmetry in complex networks
- Necessary and sufficient conditions for containment control of networked multi-agent systems
- Permanental polynomials of graphs
- The spectra of some families of digraphs
- Laplacian matrices of graphs: A survey
- Geometric achromatic and pseudoachromatic indices
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- On weakly symmetric graphs of order twice a prime
- Strong uniform times and finite random walks
- Families of metrized graphs with small tau constants
- Tutte polynomials for benzenoid systems with one branched hexagon
- Permanental roots and the star degree of a graph
- Spectra of Cayley graphs
- Automorphism group of the complete transposition graph
- The \(N\)-intertwined SIS epidemic network model
- A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
- Distance-regularised graphs are distance-regular or distance-biregular
- The hierarchical product of graphs
- The generalized hierarchical product of graphs
- Tutte polynomial of scale-free networks
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- A note on integral non-commuting graphs
- Combinatorial modulus, the combinatorial Loewner property, and Coxeter groups.
- Spanning tree formulas and Chebyshev polynomials
- Arithmetical graphs
- Distance transitive digraphs
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
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)