3 citations · 5 across the 14 of their papers we have counts for
14 papers
Isolation partitions in graphs
Gang Zhang, Weiling Yang, Xian'an Jin
Let be a graph and an integer. A subset is a -clique (resp., cycle) isolating set of if contains no -clique (resp., cycle). In…
The number of quasi-trees of bouquets with exactly one non-orientable loop
Qingying Deng, Xian'an Jin, Qi Yan
Recently, Merino extended the classical relation between the -th Fibonacci number and the number of spanning trees of the -fan graph to ribbon graphs, and established a rela…
Twist polynomial as a weight system for set systems
Qingying Deng, Xian'an Jin, Qi Yan
Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relation. Deng et al. then proved that this function on…
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph
Jingyuan Zhang, Xian'an Jin, Weigen Yan +1
As a variant of the Ulam's vertex reconstruction conjecture and the Harary's edge reconstruction conjecture, Cvetković and Schwenk posed independently the following problem: Can th…
Convolution formulas for multivariate arithmetic Tutte polynomials
Tianlong Ma, Xian'an Jin, Weiling Yang
The multivariate arithmetic Tutte polynomial of arithmetic matroids is a generalization of the multivariate Tutte polynomial of matroids. In this note, we give the convolution form…
On the maximum local mean order of sub-k-trees of a k-tree
Zhuo Li, Tianlong Ma, Fengming Dong +1
For a k-tree T, a generalization of a tree, the local mean order of sub-k-trees of T is the average order of sub-k-trees of T containing a given k-clique. The problem whether the l…