Paper Info
Title
Zeta functions and complexities of middle graphs of semiregular bipartite graphs.
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.
Year
DOI
Venue
2014
10.1016/j.disc.2014.07.013
Discrete Mathematics
Keywords
Field
DocType
Zeta function,Semiregular graph,Middle graph,Complexity
Discrete mathematics,Complete bipartite graph,Combinatorics,Edge-transitive graph,Vertex-transitive graph,Line graph,Simplex graph,Foster graph,Clique-width,Mathematics,Voltage graph
Journal
Volume
ISSN
Citations 
335
0012-365X
2
PageRank 
References 
Authors
0.41
4
1
Name
Order
Citations
PageRank
Iwao Sato17522.91