14 citations · 82 across the 27 of their papers we have counts for
5 papers · 1 filter
The minimum number of vertices and edges of connected graphs with ind-match, min-match and match
Kazunori Matsuda, Ryosuke Sato, Yuichi Yoshida
Let ind-match, min-match and match denote the induced matching number, minimum matching number and matching number of a graph , respectively. It is known that ind…
On the three graph invariants related to matching of finite simple graphs
Kazunori Matsuda, Yuichi Yoshida
Let be a finite simple graph on the vertex set and let , and denote the induced matching number, the minimum…
The regularity and -polynomial of Cameron-Walker graphs
Takayuki Hibi, Kyouko Kimura, Kazunori Matsuda +1
Fix an integer , and consider the set of all connected finite simple graphs on vertices. For each in this set, let denote the edge ideal of in the poly…
Gorenstein graphic matroids
Takayuki Hibi, Michał Lasoń, Kazunori Matsuda +2
The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic…
Gorenstein Fano polytopes arising from order polytopes and chain polytopes
Takayuki Hibi, Kazunori Matsuda, Akiyoshi Tsuchiya
Richard Stanley introduced the order polytope and the chain polytope arising from a finite partially ordered set , and showed that the Ehrhart…