Weighted complexities of graph products and bundles
From MaRDI portal
Publication:854826
DOI10.1016/j.ejc.2005.07.008zbMath1109.05057OpenAlexW2086994566MaRDI QIDQ854826
Iwao Sato, Yong Sung Park, Jin Ho Kwok
Publication date: 7 December 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.008
Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Bartholdi zeta and \(L\)-functions of weighted digraphs, their coverings and products ⋮ Zeta functions of line, middle, total graphs of a graph and their coverings ⋮ On strong graph bundles ⋮ Vertex Weighted Complexities of Graph Coverings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum genus of graph bundles
- Spanning tree formulas and Chebyshev polynomials
- Generalized doubly stochastic and permutation matrices over a ring
- Chip-firing and the critical group of a graph
- Problems in algebraic combinatorics
- A certain polynomial of a graph and graphs with an extremal number of trees
- On the critical group of the \(n\)-cube
- On the weighted complexity of a regular covering of a graph
- A note on the zeta function of a graph
- Edge-colorability of graph bundles
- The number of trees in a graph. I. II
- Zeta Functions for Images of Graph Coverings by Some Operations
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Caracteristics polynomials of some grap bundlesII
- Isomorphism Classes of Graph Bundles
- On the number of spanning trees of finite graphs
- A new 5‐arc‐transitive cubic graph
- Matrix theory. Basic results and techniques
This page was built for publication: Weighted complexities of graph products and bundles
