scientific article

Publication date: 10 October 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

graph strongly regular graphs characteristic polynomial formal power series algebraic combinatorics matchings polynomials Association Schemes Distance-Regular Graphs walk generating functions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (only showing first 100 items - show all)

A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ On the Number of All Substructures Containing at Most Four Edges ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ On the Laplacian Szeged Spectrum of Paths ⋮ A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design ⋮ Matchings in regular graphs: minimizing the partition function ⋮ Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials ⋮ About the spectra of a real nonnegative matrix and its signings ⋮ THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH ⋮ On the spectral radius, energy and Estrada index of the Sombor matrix of graphs ⋮ Unnamed Item ⋮ The optimal bound on the 3-independence number obtainable from a polynomial-type method ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Spectral extrema of graphs with bounded clique number and matching number ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ The matching polynomials of hypergraphs and weighted hypergraphs ⋮ Graphs cospectral with distance-regular graphs ⋮ State transfer on integral mixed circulant graphs ⋮ On standard bases of irreducible modules of Terwilliger algebras of Doob schemes ⋮ Strong cospectrality in trees ⋮ Quantum state transfer on integral oriented circulant graphs ⋮ Connection of $p$-ary $t$-weight linear codes to Ramanujan Cayley graphs with $t+1$ eigenvalues ⋮ How many cliques can a clique cover cover? ⋮ Irrational Quantum Walks ⋮ Invariant Synchrony Subspaces of Sets of Matrices ⋮ On Integrality in Semidefinite Programming for Discrete Optimization ⋮ Strongly regular graphs from pseudocyclic association schemes ⋮ THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH ⋮ On the spectra and spectral radii of token graphs ⋮ On the flip graphs on perfect matchings of complete graphs and signed reversal graphs ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ Unnamed Item ⋮ New Upper Bounds on the Energy of a Graph ⋮ Deranged Matchings: Proofs and Conjectures ⋮ An $A_{\alpha}$-spectral Erdős-Sós theorem ⋮ $\mathcal{D}$-index and $\mathcal{Q}$-index for spanning trees with leaf degree at most $k$ in graphs ⋮ Perfect state transfer in NEPS of some graphs ⋮ Unions of a clique and a co-clique as star complements for non-main graph eigenvalues ⋮ The spectral excess theorem for distance-regular graphs having distance-$d$ graph with fewer distinct eigenvalues ⋮ Unnamed Item ⋮ Unnamed Item ⋮ THE CORRELATION STRUCTURE OF SPATIAL AUTOREGRESSIONS ⋮ On pseudo-distance-regularity ⋮ An inequality on the cosines of a tight distance-regular graph ⋮ Dual polar graphs, a nil-DAHA of rank one, and non-symmetric dual $q$-Krawtchouk polynomials ⋮ Some open questions about random walks, involutions, limiting distributions, and generating functions ⋮ Open problems in the spectral theory of signed graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ Type-II matrices in weighted Bose-Mesner algebras of ranks 2 and 3 ⋮ On a certain class of 1-thin distance-regular graphs ⋮ A Class ofP-polynomial Table Algebras with and without Integer Multiplicities ⋮ On Middle Cube Graphs ⋮ Graphs, friends and acquaintances ⋮ Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra ⋮ What Do Networks and Elliptic Curves Have in Common? ⋮ The homogeneous weight partition and its character-theoretic dual ⋮ Tamaschke's results on Schur rings and a generalization of association schemes ⋮ Periodicity of quantum walks defined by mixed paths and mixed cycles ⋮ Central limit theorems, Lee-Yang zeros, and graph-counting polynomials ⋮ A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra ⋮ On the Hosoya index of a family of deterministic recursive trees ⋮ Pairs of quadratic forms over finite fields ⋮ A problem of Shapozenko on Johnson graphs ⋮ Structural similarity: spectral methods for relaxed blockmodeling ⋮ Graphs determined by polynomial invariants ⋮ Polynomial properties on large symmetric association schemes ⋮ The Laplacian and signless Laplacian spectrum of semi-Cayley graphs over abelian groups ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ On ABC eigenvalues and ABC energy ⋮ Equidistant families of sets ⋮ On the dependence polynomial of a graph ⋮ On the real roots of $\sigma$-polynomials ⋮ On the connectedness of the complement of a ball in distance-regular graphs ⋮ Graphs with few matching roots ⋮ Three-class association schemes on Galois rings in characteristic 4 ⋮ Delsarte set graphs with small $c_{2}$ ⋮ Landscapes and their correlation functions ⋮ Aspects of topology, genus and isomerism in closed 3-valent networks ⋮ Enumerating perfect matchings in $n$-cubes ⋮ A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs ⋮ Orbits of the hyperoctahedral group as Euclidean designs ⋮ Imprimitive cometric association schemes: constructions and analysis ⋮ Distance-regular graphs with complete multipartite $\mu$-graphs and AT4 family ⋮ Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy ⋮ Two-lit trees for lit-only $\sigma $-game ⋮ Restrictions on classical distance-regular graphs ⋮ Characterization of quantum circulant networks having perfect state transfer ⋮ Recent results on designs with classical parameters ⋮ On the connectivity of graphs in association schemes ⋮ Perfect matchings in random pentagonal chains ⋮ Adjacency preservers, symmetric matrices, and cores ⋮ On relative $t$-designs in polynomial association schemes ⋮ Weighted intriguing sets of finite generalised quadrangles ⋮ An excess theorem for spherical 2-designs ⋮ Which graphs are determined by their spectrum? ⋮ Computing the average parallelism in trace monoids. ⋮ On weight distributions of perfect colorings and completely regular codes

This page was built for publication: