Weighted complexities of graph products and bundles

DOI10.1016/J.EJC.2005.07.008MaRDI QIDQ854826zbMATH OpenOpenAlexFDO

Authors Yong Sung Park, Iwao Sato, Jin Ho Kwak

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

zbMATH Keywords

eigenvaluesprismLaplacian matrixdeterminantsMöbius ladder

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Complexity of products of some complete and complete bipartite graphs
• The weighted complexity and the determinant functions of graphs
• On the weighted complexity of a regular covering of a graph
• Number of spanning trees in different products of complete and complete tripartite graphs.
• ZETA FUNCTIONS OF GRAPH BUNDLES

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3552764 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1161299 (Why is no real title available?)
• scientific article; zbMATH DE number 3349868 (Why is no real title available?)
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A certain polynomial of a graph and graphs with an extremal number of trees
• A new 5‐arc‐transitive cubic graph
• A note on the zeta function of a graph
• Caracteristics polynomials of some grap bundlesII
• Chip-firing and the critical group of a graph
• Combinatorial matrix theory
• Edge-colorability of graph bundles
• Generalized doubly stochastic and permutation matrices over a ring
• Isomorphism Classes of Graph Bundles
• Matrix theory. Basic results and techniques
• On the critical group of the \(n\)-cube
• On the number of spanning trees of finite graphs
• On the weighted complexity of a regular covering of a graph
• Problems in algebraic combinatorics
• Spanning tree formulas and Chebyshev polynomials
• The maximum genus of graph bundles
• The number of trees in a graph. I. II
• Zeta functions for images of graph coverings by some operations

Cited in

(6)

• Zeta functions of line, middle, total graphs of a graph and their coverings
• Vertex weighted complexities of graph coverings
• Bartholdi zeta and \(L\)-functions of weighted digraphs, their coverings and products
• Recognizing weighted directed cartesian graph bundles
• On strong graph bundles
• The weighted complexity and the determinant functions of graphs

This page was built for publication: Weighted complexities of graph products and bundles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854826)