Name
Abstract | ||
|---|---|---|
We 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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0095-8956(03)00041-8 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
transformation group,distinct irreducible representation,weighted complexity,laplacian matrix,graph covering,complexity,explicit formula,graph g,irreducible representation | Discrete mathematics,Combinatorics,Strongly regular graph,Line graph,Edge-transitive graph,Graph factorization,Regular graph,Distance-regular graph,Covering graph,Voltage graph,Mathematics | Journal |
Volume | Issue | ISSN |
89 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
2 | 0.48 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hirobumi Mizuno | 1 | 80 | 18.63 |
| Iwao Sato | 2 | 75 | 22.91 |