Abstract
We consider the (stochastic) weighted complexity of a digraph D and a stochastic function from A(D) to nonnegative real numbers. Furthermore, we consider the weighted zeta function of a digraph, and present a determinant expression of it. We present a decomposition formula for the weighted zeta function of a group covering of a digraph. As an application, we give an explicit formula for the stochastic weighted complexity of a group covering of a digraph by using its stochastic weighted complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
