6 papers
Extremal trees with respect to spectral radius of restrictedly weighted adjacency matrices
Ruiling Zheng, Xiaxia Guan, Xian an Jin
For a graph and , denote by the degree of vertex . Let be a real symmetric function in and . The weighted adjacency matrix $…
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…
On coefficients of the interior and exterior polynomials
Xiaxia Guan, Xian'an Jin
The interior polynomial and the exterior polynomial are generalizations of valuations on and of the Tutte polynomial of graphs to hypergraphs, respec…
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…
Minimum degree and size conditions for the proper connection number of graphs
Xiaxia Guan, Lina Xue, Eddie Cheng +1
An edge-coloured graph is called if every two vertices are connected by a proper path. The of a connected graph , denot…
Embedding 5-planar graphs in three pages
Xiaxia Guan, Weihua Yang
A \emph{book-embedding} of a graph is an embedding of vertices of along the spine of a book, and edges of on the pages so that no two edges on the same page intersect.…