Vertex Weighted Complexities of Graph Coverings

DOI10.1142/S1005386711000071zbMath1214.05087OpenAlexW2041771847MaRDI QIDQ3067773

Iwao Sato, Hongfeng Wu, Rong Quan Feng

Publication date: 13 January 2011

Published in: Algebra Colloquium (Search for Journal in Brave)

Full work available at URL: http://worldscinet.com/ac/18/1801/S1005386711000071.html

zbMATH Keywords

complexityLaplacian matrixgraph covering

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

The \(\rho\)-moments of vertex-weighted graphs

Cites Work

• Unnamed Item
• Weighted complexities of graph products and bundles
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• Generating all graph coverings by permutation voltage assignments
• On the weighted complexity of a regular covering of a graph
• A note on the zeta function of a graph
• A combinatorial Laplacian with vertex weights
• Zeta Functions for Images of Graph Coverings by Some Operations
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Algebraic Graph Theory
• Combinatorial Matrix Theory

This page was built for publication: Vertex Weighted Complexities of Graph Coverings