Recursively constructible families of graphs
From MaRDI portal
Publication:1433010
DOI10.1016/S0196-8858(03)00088-5zbMath1041.05050MaRDI QIDQ1433010
Publication date: 15 June 2004
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C75: Structural characterization of families of graphs
Related Items
Linear Recurrence Relations for Graph Polynomials, Phase diagram of the chromatic polynomial on a torus, On the roots of independence polynomials of almost all very well-covered graphs, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions
Cites Work
- Unnamed Item
- Unnamed Item
- The number of spanning trees in circulant graphs
- Irreducibility of the Tutte polynomial of a connected matroid
- Improved bounds for the number of forests and acyclic orientations in the square lattice
- Codichromatic graphs
- Recursive families of graphs
- Chromatic polynomials and their zeros and asymptotic limits for families of graphs