Vertex Weighted Complexities of Graph Coverings
From MaRDI portal
Publication:3067773
DOI10.1142/S1005386711000071zbMath1214.05087MaRDI 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
15A15: Determinants, permanents, traces, other special matrix functions
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
Related Items
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