scientific article; zbMATH DE number 3445271
From MaRDI portal
Publication:4770409
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 local structure of a bipartite distance-regular graph
- Laplacian spectral characterization of disjoint union of paths and cycles
- Enumeration of graphs with the same Ihara zeta function
- On the algebraic connectivity of a double covering graph
- Identification and estimation of linear social interaction models
- Stability of twisted states in the Kuramoto model on Cayley and random graphs
- Distance-balanced graphs: symmetry conditions
- Automorphisms of Cayley graphs
- On distance-regular graphs with height two. II
- Curved thin-walled open-closed cross section beams with finite width
- Periodicity of quantum walks defined by mixed paths and mixed cycles
- Koszul algebras and flow lattices
- A note on the Tutte polynomial and the automorphism group of a graph
- The diameters of almost all Cayley digraphs
- Normal edge-transitive and \(\frac{1}{2}\)-arc-transitive semi-Cayley graphs
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions
- Harmonic functions on locally finite networks
- Complexity of graph covering problems
- On almost nexus semi-symmetric designs
- On the automorphism group of polyhedral graphs
- Cubic graphs and the golden mean
- A generalization of the zero-divisor graph for modules
- 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
- Hybrid event‐triggered control of linear multiagent systems via a fully distributed approach
- Product networks:a family of symmetric interconnection networks from a group model
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
- Fractional isomorphism of graphs
- Graphs on which a dihedral group acts edge-transitively
- On large ( ,D)-graphs
- Eigenvalues and expanders
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- Some properties of the spectrum of graphs
- The rank of a complex unit gain graph in terms of the matching number
- Metacirculant tournaments whose order is a product of two distinct primes
- One conjecture of bubble-sort graphs
- Accelerated diffusion algorithms for dynamic load balancing.
- Characterization of split graphs with at most four distinct eigenvalues
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- Pseudo-Strong Regularity Around a Set
- Distance-regular graphs in block form
- Patterns that allow given row and column sums
- Gibbsian stationary non-equilibrium states
- Equiarboreal graphs
- One more proof of the first linear programming bound for binary codes and two conjectures
- Interval-regular graphs
- Inverting graphs of rectangular matrices
- On encodings of spanning trees
- A theory of Cartesian product and factorization of circulant graphs
- The classification of distance-regular graphs of type IIB
- Vertex-primitive groups and graphs of order twice the product of two distinct odd primes
- On two Laplacian matrices for skew gain graphs
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs
- On the spectrum of an extremal graph with four eigenvalues
- Distance mean-regular graphs
- The Twenty-fifth International Symposium on Functional Equations, August 16--22, 1987, Hamburg-Rissen, Germany. (Abstracts of the meeting)
- Doubly transitive lines. I: Higman pairs and roux
- Automorphism groups of self-complementary vertex-transitive graphs
- Chromatic polynomials and broken cycles
- A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
- Stability of dynamical networks with non-identical nodes: a multiple \(V\)-Lyapunov function method
- A generalization of Boesch's theorem
- Six signed Petersen graphs, and their automorphisms
- Adjacency matrix of a semigraph
- \(Z_3\)-connectivity of wreath product of graphs
- Dual concepts of almost distance-regularity and the spectral excess theorem
- A bound for the complexity of a simple graph
- On distance-regular graphs with height two
- Combinatorics in glass
- Burnside chromatic polynomials of group-invariant graphs
- Arrangements of lines and monodromy of associated Milnor fibers
- COMMON NEIGHBOR POLYNOMIAL OF SOME DENDRIMER STRUCTURES
- An approach to parallel algorithm design
- Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
- Homogeneity conditions in graphs
- Graph covers with two new eigenvalues
- Coloured graphical models and their symmetries
- On the second immanantal polynomials of graphs
- Adjacency preservers on invertible Hermitian matrices. I.
- On distance-regularity in graphs
- Cubic symmetric graphs of order twice an odd prime-power
- New largest known graphs of diameter 6
- Geometric aspects of 2-walk-regular graphs
- On the Brauer Group of Toric Varieties
- On \(t\)-cliques in \(k\)-walk-regular graphs
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
- A new approach to gross error detection for GPS networks
- Distance-transitive representations of the symmetric groups
- Zeons, permanents, the Johnson scheme, and generalized derangements
- Matroid Steiner problems, the Tutte polynomial and network reliability
- Automorphism groups of symmetric graphs of valency 3
- On a class of distance transitive graphs
- Isomorphism between Cayley (di)graphs
- Tetravalent edge-transitive graphs of order \(p^2q\)
- Characterizing \((\ell ,m)\)-walk-regular graphs
- Edge-transitive graphs and combinatorial designs
- Characteristic polynomials and spectra of Boolean 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)