Vertex Weighted Complexities of Graph Coverings
2011
In this paper the vertex weighted complexity of a graph is considered. A generalization of Northshield's Theorem for the vertex weighted complexity of a graph is presented. Furthermore, an explicit formula for the vertex weighted complexity of a covering graph of G in terms of that of G is given.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
1
Citations
NaN
KQI