activity
20132022
most citedCodegree conditions for tiling complete -partite -graphs and loose cycles

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

collaborators

6 papers

math.CO2022

On the conjecture about the exponential reduced Sombor index

Wei Gao

Let be a graph and be the degree of the vertex . The exponential reduced Sombor index of , denoted by , is defined as $$e^{SO_…

math.CO2017★ 1 cited

-Foldability of Words

Beth Bjorkman, Garner Cochran, Wei Gao +6

We extend results regarding a combinatorial model introduced by Black, Drellich, and Tymoczko (2017+) which generalizes the folding of the RNA molecule in biology. Consider a word…

math.CO2017

Sign patterns that require exist for each

Wei Gao, Zhongshan Li, Lihua Zhang

The refined inertia of a square real matrix is the ordered -tuple , where (resp., ) is the number of eigenvalues of with positive (resp…

math.CO2016★ 6 cited

Codegree conditions for tiling complete -partite -graphs and loose cycles

Wei Gao, Jie Han, Yi Zhao

Given two -graphs (-uniform hypergraphs) and , a perfect -tiling (or an -factor) in is a set of vertex disjoint copies of that together cover the vertex…

math.CO2015

On the distance spectra of graphs

Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8

The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…

math.CO2013

Sign patterns with minimum rank 3 and point-line configurations

Guangming Jing, Wei Gao, Yubin Gao +4

A \emph{sign pattern (matrix)} is a matrix whose entries are from the set . The \emph{minimum rank} (respectively, \emph{rational minimum rank}) of a sign pattern matr…