5 citations · 5 across the 6 of their papers we have counts for
6 papers · 1 filter
Extremal trees, unicyclic and bicyclic graphs with respect to -Sombor spectral radii
Ruiling Zheng, Tianlong Ma, Xian'an Jin
For a graph and , denote by (or for short) the degree of vertex . The -Sombor matrix () of…
Tight toughness, isolated toughness and binding number bounds for the -factors
Xiaxia Guan, Tianlong Ma, Chao Shi
The -factor of a graph is a spanning subgraph whose each component is either or . In this paper, a sufficient condition with regard to tight toughness, isol…
A direct and elementary proof of the well-definedness of the interior and exterior polynomials of hypergraphs
Xiaxia Guan, Xian'an Jin, Tianlong Ma
T. Kálmán (A version of Tutte's polynomial for hypergraphs, Adv. Math. 244 (2013) 823-873.) introduced the interior and exterior polynomials which are generalizations of the Tutte…
Tutte polynomials of fan-like graphs with applications in benzenoid systems
Tianlong Ma, Xian'an Jin, Fuji Zhang
We study the computation of the Tutte polynomials of fan-like graphs and obtain expressions of their Tutte polynomials via generating functions. As applications, Tutte polynomials,…
Fractional strong matching preclusion for Cartesian product graphs
Bo Zhu, Tianlong Ma
The strong matching preclusion number of a graph, introduced by Park and Ihm in 2011, is the minimum number of vertices and edges whose deletion results in a graph that has neither…
Fractional matching preclusion for generalized augmented cubes
Tianlong Ma, Yaping Mao, Eddie Cheng +1
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A…