3 citations · 6 across the 2 of their papers we have counts for
2 papers
math.CO2020★ 3 cited
On complexity and Jacobian of cone over a graph
L. A. Grunwald, I. A. Mednykh
For any given graph consider a graph which is a cone over graph In this paper, we study two important invariants of such a cone. Namely, complexity (the nu…
math.CO2019★ 3 cited
The number of rooted forests in circulant graphs
L. A. Grunwald, I. A. Mednykh
In this paper, we develop a new method to produce explicit formulas for the number of rooted spanning forests in the circulant graphs and…