Results 31 to 40 of about 6,506,964 (218)

Graphs with distinguishing sets of size k

Kuwait Journal of Science
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar, Muhammad Fazil, Imran Javaid, Muhammad Murtaza   +3 more
doaj   +1 more source

Forbidden subgraph pairs for traceability of block-chains

Electronic Journal of Graph Theory and Applications, 2013
A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path.
Binlong Li, Hajo Broersma, Shenggui Zhang   +2 more
doaj   +1 more source

Mendelian Randomization and Double Machine Learning Modeling Reveal Brain Imaging‐Derived Phenotypes as Functional Contributors to 18 Autoimmune Inflammatory Diseases

Advanced Science, EarlyView.
This schematic integrates the eight statistically significant causal relationships identified between 1,366 brain imaging‐derived phenotypes (IDPs) and 18 autoimmune inflammatory diseases (AIDs). Arrows indicate the direction of causality inferred from bidirectional two‐sample MR analyses.
Jinbin Chen, Xin Wang, Haifeng Ding, Bosheng Zheng, Keni Zeng, Chuying Hu, Jiayi Liu, Xiao Zhu, Haibing Yu   +8 more
wiley   +1 more source

The complexity of the connected graph access structure on seven participants

Journal of Mathematical Cryptology, 2017
In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
doaj   +1 more source

Stamping Lithography on Arbitrary Surfaces based on Self‐Assembly of Colloidal Particles

Advanced Science, EarlyView.
A new method called Stamping Lithography for three‐dimensional (3D) circuits manufacturing is proposed, which comprises a resist mask stamping process based on self‐assembly of colloidal particles and a subsequent etching process. It replaces the photoresist with self‐assembled particles and the exposure process with stamping, making it feasible to ...
Guoxu Yu, Heyang Zhang, Yiming Li, Lele Song, Jinglin Jia, Lei Chen, Ding Weng, Yuan Ma, Jiadao Wang   +8 more
wiley   +1 more source

Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. [PDF]

PLoS ONE, 2014
Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in ...
Mark D McDonnell, Ömer Nebil Yaveroğlu, Brett A Schmerl, Nicolangelo Iannella, Nicolangelo Iannella, Lawrence M Ward   +5 more
doaj   +1 more source

Diversity, transfer potential, and transcriptional activity of virus‐carried antibiotic resistance genes in global estuaries

iMetaOmics, EarlyView.
Estuaries are vital hotspots for antibiotic resistance genes (ARGs) due to substantial antibiotic pollution. Although viruses have been proposed as key reservoirs and important disseminators of ARGs in environments, their contribution to the estuarine antibiotic resistome remains largely unknown.
Xiao‑Qing Luo, Xiyang Dong, Jia‑Ling Li, Ji‐Cheng Yao, Ziqi Peng, Qi Li, Zi‐Wen Yang, Yang Yuan, Wen‑Jun Li, Pandeng Wang   +9 more
wiley   +1 more source

Perfect Matching Under Precedence Constraints

Networks, EarlyView.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

Maximum common subgraph: some upper bound and lower bound results

BMC Bioinformatics, 2006
Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F, Lai Jing, Huang Xiuzhen   +2 more
doaj   +1 more source

Robustness Assessment of Public Transport Networks in Various Graph Representations: Systematic Review, Decision Support, and Case Study

Networks, EarlyView.
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk, Stefan Voß, Raka Jovanovic   +2 more
wiley   +1 more source