On the weighted complexity of a group covering of a digraph

MaRDI QIDQ3053013zbMATH OpenFDO

Authors Iwao Sato, Seiken Saito

Publication date 3 November 2010

Full work available at URL http://pphmj.com/abstract/5120.htm

zbMATH Keywords

complexityLaplacian matrixdigraph covering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Determinants, permanents, traces, other special matrix functions (15A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the weighted complexity of a regular covering of a graph
• The stochastic weighted complexity of a group covering of a digraph
• Vertex weighted complexities of graph coverings
• The weighted complexity and the determinant functions of graphs
• Weighted Bartholdi zeta functions of digraphs

Cited in

(3)

• Vertex weighted complexities of graph coverings
• New proofs for Levine's theorems
• The stochastic weighted complexity of a group covering of a digraph

This page was built for publication: On the weighted complexity of a group covering of a digraph

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