activity
20152023
most citedOrdering of bicyclic graphs by matching energy

7 citations · 33 across the 43 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.CO2021★ 5 cited

On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees

Xiangxiang Liu, Hajo Broersma, Ligong Wang

We partly confirm a Brualdi-Solheid-Turán type conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erdős-Sós Conjecture that any tree of order is…

math.CO2021

Growth rates of the bipartite Erdős-Gyárfás function

Xihe Li, Hajo Broersma, Ligong Wang

Given two graphs and a positive integer , an -coloring of is an edge-coloring of such that every copy of in receives at least distinct colors.…

math.CO2021★ 4 cited

Spectral radius conditions for the existence of all subtrees of diameter at most four

Xiangxiang Liu, Hajo Broersma, Ligong Wang

Let denote the spectral radius of a graph . We partly confirm a conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erdős-Sós Conjecture th…

math.CO2021

On the spectral radius and energy of non-strongly connected digraphs

Xiuwen Yang, Ligong Wang

Let be the -matrix of a digraph and be the eigenvalues of . Let be the spectral radius of and $E_α(G)=…

math.CO2021

On the spectral radius of strongly connected digraphs

Weige Xi, Ligong Wang

Let be a digraph with adjacency matrix . Let be the diagonal matrix with outdegrees of vertices of . Nikiforov \cite{Niki} proposed to study the convex combinat…