Results 211 to 220 of about 5,977,062 (227)
Multivariate Genome-Wide Analysis Delineates Shared Genetic Determinants Across Periodontal and Oral Microbial Phenotypes. [PDF]
Zhang Y, Chen M, Zhang F.
europepmc +1 more source
The Partition Dimension of a Path Graph
Resolving partition is part of graph theory. This article, explains about resolving partition of the path graph, with. Given a connected graph  and  is a subset of  writen .
Rahmi, Fathur, Ramdhani, Vivi
exaly +2 more sources
Partition Dimension of Complete Multipartite Graph [PDF]
Determining a resolving partition of a graph is an interesting study in graph theory due to many applications like censor design, compound classification in chemistry, robotic navigation and internet network. Let and , the distance between an is . For
Hasmawati Hasmawati
exaly +2 more sources
Resolving Dominating Partitions in Graphs [PDF]
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.
Mercè Mora Gine +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Colour Class Domination equivalence partition and Colourful resolving sets in graphs
Punjab University Journal of MathematicsLet 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 +3 more
openaire +1 more source
Bounds on the Partition Dimension of Convex Polytopes
Combinatorial Chemistry and High Throughput Screening, 2022Muhammad Faisal Nadeem, Jia-Bao Liu
exaly

