Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 4 of 4

Order by Relevance | Title | Year of publication

Packing four copies of a tree into a complete bipartite graph

Liqun Pu; Yuan Tang; Xiaoli Gao — 2022

Czechoslovak Mathematical Journal

In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009) gives a conjecture: For each tree $T$ of order $n$ and each integer $k \geq 2$ , there is a $k$ -packing of $T$ in a complete bipartite graph $B_{n + k - 1}$ whose order is $n + k - 1$ . We prove the conjecture is true for $k = 4$ .

Global asymptotic stability in a class of difference equations.

Yang, Xiaofan; Cui, Limin; Tang, Yuan Yan; Cao, Jianqiu — 2007

Advances in Difference Equations [electronic only]

A new part-metric-related inequality chain and an application.

Yang, Xiaofan; Sun, Fangkuan; Tang, Yuan Yan — 2008

Discrete Dynamics in Nature and Society

Direct neighborhood discriminant analysis for face recognition.

Cheng, Miao; Fang, Bin; Tang, Yuan Yan; Wen, Jing — 2008

Mathematical Problems in Engineering

Page 1

Download Results (CSV)