AbstractWe consider the weighted complexity of a graph G, and present a generalization of Northshield's Theorem on the complexity of G. Furthermore, we give an explicit formula for the weighted complexity of a regular covering H of G in terms of that of G and a product of determinants over the all distinct irreducible representations of the covering transformation group of H
AbstractWe consider the (stochastic) weighted complexity of a digraph D and a stochastic function fr...
AbstractWe define the weighted Bartholdi zeta function and a weighted L-function of a graph G, and g...
AbstractIn this paper we study representations of permutation groups as automorphism groups of color...
AbstractThe complexity of a graph can be obtained as a derivative of a variation of the zeta functio...
AbstractWe consider the weighted complexity of a graph G, and present a generalization of Northshiel...
The complexity kappa(G) of a graph G is the number of spanning trees in G. In spite of its importanc...
AbstractThe complexity κ(G) of a graph G is the number of spanning trees in G. In spite of its impor...
AbstractThe definitions of four previously studied parameters related to total coverings and total m...
Coverings of undirected graphs are used in distributed computing, andunfoldings of directed graphs i...
AbstractA weighted graph is one in which each edge e is assigned a nonnegative number w(e), called t...
Regular Coverings - Structure and Complexity Michaela Seifrtová The thesis consists of two main part...
Consider an edge-weighted graph G = (V, L), and define a k-cover C as a subset of the edges L such t...
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An ...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
Apart from mathematics, covering techniques have long been known as a powerful tool in different are...
AbstractWe consider the (stochastic) weighted complexity of a digraph D and a stochastic function fr...
AbstractWe define the weighted Bartholdi zeta function and a weighted L-function of a graph G, and g...
AbstractIn this paper we study representations of permutation groups as automorphism groups of color...
AbstractThe complexity of a graph can be obtained as a derivative of a variation of the zeta functio...
AbstractWe consider the weighted complexity of a graph G, and present a generalization of Northshiel...
The complexity kappa(G) of a graph G is the number of spanning trees in G. In spite of its importanc...
AbstractThe complexity κ(G) of a graph G is the number of spanning trees in G. In spite of its impor...
AbstractThe definitions of four previously studied parameters related to total coverings and total m...
Coverings of undirected graphs are used in distributed computing, andunfoldings of directed graphs i...
AbstractA weighted graph is one in which each edge e is assigned a nonnegative number w(e), called t...
Regular Coverings - Structure and Complexity Michaela Seifrtová The thesis consists of two main part...
Consider an edge-weighted graph G = (V, L), and define a k-cover C as a subset of the edges L such t...
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An ...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize...
Apart from mathematics, covering techniques have long been known as a powerful tool in different are...
AbstractWe consider the (stochastic) weighted complexity of a digraph D and a stochastic function fr...
AbstractWe define the weighted Bartholdi zeta function and a weighted L-function of a graph G, and g...
AbstractIn this paper we study representations of permutation groups as automorphism groups of color...
DOI
Add to ORKG