Results 1 to 10 of about 144,099 (120)

The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path

Applied Mathematics Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Haiyuan Yao
exaly   +3 more sources

From interaction to co-association --a Fisher r-to-z transformation-based simple statistic for real world genome-wide association study. [PDF]

PLoS ONE, 2013
Currently, the genetic variants identified by genome wide association study (GWAS) generally only account for a small proportion of the total heritability for complex disease. One crucial reason is the underutilization of gene-gene joint effects commonly
Zhongshang Yuan, Hong Liu, Xiaoshuai Zhang, Fangyu Li, Jinghua Zhao, Furen Zhang, Fuzhong Xue   +6 more
doaj   +2 more sources

Z-transformation graphs of perfect matchings of plane bipartite graphs

Discrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Fuji Zhang, Haiyuan Yao
openaire   +4 more sources

Z-transformation graphs of perfect matchings of hexagonal systems

Discrete Mathematics, 1988
Given a hexagonal system H, the Z-transformation graph Z(H) is the graph whose vertices are perfect matchings of H. Two vertices are adjacent in Z(H) if the symmetric difference of the corresponding matchings is a hexagon of H. The authors give some properties of this transformation graph: Z(H) is bipartite, connected and is either a path or a graph of
Zhang, F. J., Guo, X. F., Chen, R. S.
openaire   +3 more sources

Z -transformation graphs of maximum matchings of plane bipartite graphs

Discrete Applied Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Rijun Zha, Haiyuan Yao
openaire   +3 more sources

The connectivity of Z-transformation graphs of perfect matchings of polyominoes

Discrete Mathematics, 1996
Let \(G\) be a plane graph. The \(Z\)-transformation graph \(Z(G)\) of \(G\) is the graph whose vertices are the perfect matchings of \(G\) with two vertices being adjacent if and only if the symmetric difference of the corresponding perfect matchings consists of the boundary of a single finite face of \(G\).
Heping Zhang
openaire   +2 more sources

Total Z-transformation graphs of perfect matching of plane bipartite graphs

Electronic Notes in Discrete Mathematics, 2000
Abstract The total Z-transformation graph and digraph of perfect matchings of a plane bipartite graph are defined. For a plane elementary bipartite graph it is shown that its total Z-transformation graph and digraph are 2-connected and strongly connected respectively.
Heping Zhang, Fuji Zhang
openaire   +2 more sources

Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems

Discrete Applied Mathematics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, RS, Zhang, FJ
openaire   +4 more sources

Weighted Group Consensus for Discrete-Time Heterogeneous Multi-Agent Systems in the Cooperative-Competitive Network With Time Delays

IEEE Access, 2019
Group consensus is investigated for a class of discrete-time heterogeneous multi-agent systems which are composed of first-order and second-order agents with communication and input time delays in this paper.
Xingcheng Pu, Longlong Zhao, Chaowen Xiong   +2 more
doaj   +2 more sources

Weighted Group Consensus of Heterogeneous MASs Without Spanning Trees: A Complex Frequency-Domain Approach Under Time Delays and Packet Loss

Complexity
This study examines the weighted group consensus problem in discrete-time HMASs with cooperative–competitive networks under the influence of packet loss and time delays.
Xia Sun, Xingcheng Pu
doaj   +2 more sources