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)
- 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
- Spectral characterization of the Hamming graphs
- Asymptotic enumeration of Latin rectangles
- Comparing universal covers in polynomial time
- Clique polynomials and independent set polynomials of graphs
- The spectrum and Laplacian spectrum of the dice lattice
- Evaluations of Graph Polynomials
- Spectral properties and asymptotic periodicity of flows in networks
- Constructing the vertex-transitive graphs of order 24
- A finite group attached to the laplacian of a graph
- Forest matrices around the Laplacian matrix
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Diameters of cubic graphs
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- Containment control of continuous-time linear multi-agent systems with aperiodic sampling
- Regular groups of automorphisms of cubic graphs
- Diffusion and elastic equations on networks
- Containment of linear multi-agent systems under general interaction topologies
- Lower bounds for multicolor classical Ramsey numbers \(R\overbrace{(q, q,\dots, q)}^n\)
- Spectral partitioning works: planar graphs and finite element meshes
- Perfect codes in graphs
- Spectra of digraphs
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- Orientation of signed graphs
- Perfect state transfer, graph products and equitable partitions
- Labeled versus unlabeled distributed Cayley networks
- Semigroups for flows in infinite networks
- Estrada index of general weighted graphs
- Containment control of fractional-order multi-agent systems with time-varying delays
- On quasi-Cayley graphs
- Gossiping and routing in undirected triple-loop networks
- Arc-transitive abelian regular covers of cubic graphs
- Unimodular equivalence of graphs
- Edge-colorability of graph bundles
- Dominating Cartesian products of cycles
- Enumerative applications of a decomposition for graphs and digraphs
- Complex surface singularities from the combinatorial point of view
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- An averaging principle for combined interaction graphs-connectivity and applications to genetic switches
- Expansions of Chromatic Polynomials and Log-Concavity
- Explicit Concentrators from Generalized N-Gons
- The finite vertex-primitive and vertex-biprimitive \(s\)-transitive graphs for \(s\geq 4\)
- Paley and the Paley Graphs
- Constructions of small regular bipartite graphs of girth 6
- Counting spanning trees in self-similar networks by evaluating determinants
- Acyclic orientations on the Sierpinski gasket
- PRODUCTS OF CIRCULANT GRAPHS
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Laplacian spectral characterization of disjoint union of paths and cycles
- 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
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)