The stochastic weighted complexity of a group covering of a digraph

DOI10.1016/j.laa.2008.05.023zbMath1144.05322OpenAlexW2100164977MaRDI QIDQ947654

Iwao Sato

Publication date: 6 October 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.023

zbMATH Keywords

complexityLaplacian matrixstochastic matrixdigraph covering

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Line-digraphs, arborescences and theorems of Tutte and Knuth
• On the weighted complexity of a regular covering of a graph
• A note on the zeta function of a graph
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Block Coding and a Zeta Function for Finite Markov Chains
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The stochastic weighted complexity of a group covering of a digraph