Showing math.COShow all
2 papers · 1 filter
math.CO2024
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…
math.CO2024
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…