On the weighted complexity of a regular covering of a graph

DOI10.1016/S0095-8956(03)00041-8zbMath1023.05075OpenAlexW2046971956MaRDI QIDQ1410729

Iwao Sato, Hirobumi Mizuno

Publication date: 15 October 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00041-8

zbMATH Keywords

complexityLaplacian matrixgraph covering

Mathematics Subject Classification ID

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) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Weighted complexities of graph products and bundles ⋮ A note on Bartholdi zeta function and graph invariants based on resistance distance ⋮ Generalized characteristic polynomials of graph bundles ⋮ The stochastic weighted complexity of a group covering of a digraph ⋮ The weighted Kirchhoff index of a graph ⋮ The weighted complexity and the determinant functions of graphs ⋮ Vertex Weighted Complexities of Graph Coverings ⋮ The partial differential coefficients for the second weighted Bartholdi zeta function of a graph ⋮ The zeta functions of dihypergraphs and dihypergraph coverings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• Generating all graph coverings by permutation voltage assignments
• A note on the zeta function of a graph
• Zeta functions of graph coverings
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• Zeta Functions for Images of Graph Coverings by Some Operations
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE

This page was built for publication: On the weighted complexity of a regular covering of a graph