Results 141 to 150 of about 30,352 (163)
Some of the next articles are maybe not open access.
Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs
Cell, 2020Kevin Hadi +2 more
exaly
Communications on Applied Nonlinear Analysis
Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices ...
openaire +1 more source
Let G be a graph. A bijection f:V→ {1,2,…..|V|} is called a prime labeling [3] if for each edge e=uv in E, we have GCD{ f(u),f(v)}=1. A graph that admits a prime labeling is said to be a prime graph. In this paper we show that bull graph admits Prime labeling in the context of variety graph operations namely duplication of vertex, fusion of vertices ...
openaire +1 more source
A (sub)graph isomorphism algorithm for matching large graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004Pasquale Foggia +2 more
exaly