Results 201 to 210 of about 6,806 (225)

Complete mitochondrial genome characterization and exploratory mitochondrial DNA modification signals in square-head catfish Chaca chaca. [PDF]

Sci Rep
Tripathy PS, Dann L, Parida SN, Rout AK, Parhi J, Behera BK, Pandey PK.   +6 more
europepmc   +1 more source

Discovery and Optimization of Potent and Subtype-Selective Urea-Derived Na_V1.8 Inhibitors. [PDF]

ACS Med Chem Lett
Dialer C, Krüger S, Wagener M, Mülbaier M, Peil S, Marigo M, Hagendorf S, Cao L, Molina CR, Morgan P, Young C, Ribeiro LR, Slynko I, Ritter S, Guberman M, Hass M, Klosky S, la Tendresse U, Gussmann C, Kühnert S, Peters S, Reichardt-Ockenfeld S, Depmeier H, Jakob F.   +23 more
europepmc   +1 more source

Chromosome-level haplotype-resolved assembly of highly heterozygous grass genomes with PhaseGrass. [PDF]

Nat Commun
Chen Y, Copetti D, Kölliker R, Mascher M, Himmelbach A, Stein N, Studer B.   +6 more
europepmc   +1 more source

On the partition dimension of trees

Discrete Applied Mathematics, 2014
10.1016/j.dam.2013.09.026Given an ordered partition ?={P1,P2,., Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v?V with respect to the partition ? is the vector r(v|?)=(d(v,P1),d(v,P2),.,d(v,Pt)), where d(v,
Juan A Rodríguez-Velázquez, Ismael G Yero, Magdalena Lemanska   +2 more
exaly   +2 more sources

Resolving dominating partitions in graphs [PDF]

Discrete Applied Mathematics, 2019
A partition ¿ ={S1,...,Sk}of the vertex set of a connected graphGis called aresolvingpartitionofGif for every pair of verticesuandv,d(u,Sj)6=d(v,Sj), for some partSj. Thepartition dimensionßp(G) is the minimum cardinality of a resolving partition ofG.
C Hernando, Mercè Mora, Ignacio M Pelayo   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Colour Class Domination equivalence partition and Colourful resolving sets in graphs

Punjab University Journal of Mathematics
Let H = (V,E) be a simple graph. A subset S of V(H) is an equivalence set if the subgraph induced by S is component-wise complete. Let P = {V1,V2, , Vk} be a partition of V (H) where each Vi,1 ≤ i ≤ k is an equivalence set of H. The partition P is called a colourful domination equivalence partition if the set D = {u1,u2, , uk} where ui,1 ≤ i ≤ k are ...
J. Sivakumar, A. Wilson Baskar, R. Sundareswaran, V. Swaminathan   +3 more
openaire   +1 more source