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)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items
Domination with decay in triangular matchstick arrangement graphs ⋮ Tutte polynomials for benzenoid systems with one branched hexagon ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ A general method for computing Tutte polynomials of self-similar graphs ⋮ On sequences of polynomials arising from graph invariants ⋮ \(c_2\) invariants of recursive families of graphs ⋮ Some new results on colour-induced signed graphs ⋮ Families of toric chemical reaction networks ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ 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 ⋮ Betweenness centrality in some classes of graphs ⋮ Potts model partition functions on two families of fractal lattices ⋮ Linear Recurrence Relations for Graph Polynomials ⋮ Recurrence relations for graph polynomials on bi-iterative families of graphs ⋮ A study on prefixes of \(c_2\) invariants ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
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
