Wei Wang

activity

20102017

most citedGeneralized Spectral Characterization of Graphs: Revisited

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2017

The Complexity of All $(g, f)$ -Factor Problem

Hongliang Lu

Let $G$ be a graph with vertex set $V$ and let $g, f : V \to Z^{+}$ be two functions such that $g \leq f$ . We say that $G$ has all $(g, f)$ -factors if $G$ has an $h$ -f…

math.CO2014★ 1 cited

A simple arithmetic criterion for graphs being determined by their generalized spectra

Wei Wang

A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$ , $H$ and $G$ are cospectral with cospectral complements implies that $H$ is is…

math.CO2013★ 2 cited

Generalized Spectral Characterization of Graphs: Revisited

Wei Wang

A graph $G$ is said to be \textit{determined by its generalized spectrum} (DGS for short) if for any graph $H$ , $H$ and $G$ are cospectral with cospectral complements implies that…

math.CO2010

Vertex-deleted subgraphs and regular factors from regular graph

Hongliang Lu, Bing Bai, Wei Wang

Let $k$ , $m$ and $r$ be three integers such that $2 \leq k \leq m \leq r$ . Let $G$ be a $2 r$ -regular, $2 m$ -edge-connected graph of odd order. We obtain some sufficient conditions, whi…

The Complexity of All (g,f)-Factor Problem

A simple arithmetic criterion for graphs being determined by their generalized spectra

Generalized Spectral Characterization of Graphs: Revisited

Vertex-deleted subgraphs and regular factors from regular graph

The Complexity of All $(g, f)$ -Factor Problem