| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647043 | Discrete Mathematics | 2014 | 8 Pages |
Abstract
We give a determinant expression for the zeta function of the middle graph of a semiregular bipartite graph G and express the complexity of the middle graph of G by using the complexity of G. As a corollary, we obtain an explicit formula for the complexity of the middle graph of a complete bipartite graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Iwao Sato,