4 papers · 1 filter
Asymmetric Colorings of Disjoint Unions of Graphs
Bruno Aguilar, Daibik Barik, Jetharam Bhambhu +7
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investig…
Subdivision method in the Laplacian matching polynomial
Jiang-Chao Wan, Yi Wang, Zhi-Yuan Wang
As a bridge connecting the matching polynomial and the Laplacian matching polynomial of graphs, the subdivision method is expected to be useful for investigating the Laplacian matc…
On the homotopy type of the space of fiberings of by simple closed curves
Yi Wang, Jingye Yang
For most aspherical Seifert-fibered 3-manifolds , the space of Seifert fiberings is known to have contractible components. It is also known that the space of Hopf fiberi…
Limiting characters at ideal points detecting twice-punctured tori
Yi Wang
The limiting character, introduced by Tillmann, has been studied recently in the context of Culler-Shalen theory. We extend the methods of the author's previous work to show that c…