GRAPH-SET MOTIF
4 Dimethylaminopyridinium picrate: supramolecular aggregation through extensive N—H⋯O and C—H⋯O interactions
... of graph-set motif S(5) (Etter, 1990; Bernstein et ...similar motif is generated by the C5ÐH5 O5 and C5ÐH5 O6 ...of graph-set motif S(5). A similar motif is ...
15
2 Nitrophenyl 3 nitrobenzenesulfonate
... The crystal structure is stabilized by weak C—H···O interactions (Table 2). The range of H···O distances found in (I) agrees with that found for weak C—H···O bonds (Desiraju & Steiner, 1999). As shown in Fig. 2, each ...
11
2 Amino 4 (3 methyl 3 p xylylcyclobutyl) 1,3 thiazole
... An intermolecular N2—H1 N1i hydrogen bond symmetry code as in Table 2 links the molecules, forming a hydrogen-bonded dimer of graph-set motif R22 8 Fig.. Of greater interest is an inter[r] ...
11
Redetermination of 8 tosyloxyquinoline at 100 K: supramolecular aggregation through weak C–H⋯O and C–H⋯N interactions
... bonds. The C1ÐH1B O3/C1ÐH1B O1 and C15Ð H15 O1/C15ÐH15 O2 interactions constitute two pairs of bifurcated homo bonds with oxygen acceptor atoms. The C16ÐH16 O2/C16ÐH16 N interactions form a pair of bifurcated hetero ...
12
(E) 13 (2 Bromophenyl)micheliolide
... (3E,3aS,6Z,9R,9aS,9bS)-3-(2-bromobenzylidene)-9-hydroxy- 6,9-dimethyl-3,3a,4,5,7,8,9,9a-octahydroazuleno[4,5-b]furan- 2(9bH)-one] was prepared by the reaction of 1-bromo-2- iodobenzene with micheliolide [systematic name: ...
9
(anti Chloridothiosemicabazide κS)bis(triphenylphosphane κP)copper(I) 0 48 hydrate
... [graph-set motif S(5)] stabilizes the thiosemicarbazide ligand in its anti conforma- tion, and an intramolecular N—H Cl hydrogen bond between the hydrazine N—H group and the chloride anion influences ...
13
4 Dimethylaminopyridinium–4 nitrophenolate–4 nitrophenol (1/1/1)
... As shown in Fig. 2, each of the C3ÐH3 O1, C5Ð H5 O2, C9ÐH9 O5 and C11ÐH11 O4 interactions generates one S(5) graph-set motif (Etter, 1990; Bernstein et al., 1995). The C8ÐH8 N3 and N3ÐH3B O6 ...
10
Crystal structure of 4 amino 5 chloro 2,6 dimethylpyrimidinium thiophene 2,5 dicarboxylate
... ring graph set motif and – stacking interactions between the pyrimidinium ring and the thiophene ring with an observed interplanar distance of ...
9
8 Quinolyl 3 nitrobenzenesulfonate
... of graph-set motif S(5) (Etter, 1990; Bernstein et ...one set of heteroatomic trifurcated donor bonds, and the C17ÐH17 N4, C17ÐH17 O7 and C17ÐH17 O10 interactions constitute a second ...
16
2 Chloro (3 methoxysalicylidene)aniline
... The title molecule (Fig. 1) is slightly distorted from a planar arrangement. The dihedral angle between the two aromatic rings is 7.8 (2)° and the torsion angle C6—N1—C7—C8 is −179.1 (3)°. The almost planar conformation ...
10
Vol 6, No 8 (2015)
... Conversely suppose FL(G) = F(G) and G is a nontrivial connected graph. We now prove that G is a block. On the contrary, assume G has at least two blocks. By Remark 5, the number of lines in F(G) is the sum of the ...
5
collusion set detection using graph clustering DMKD2008
... collusion set of size m in the trading data and then each algorithm generates a set (collection) of candidate collusion ...collusion set is a false alarm if it does not include the true collusion ...
30
THE COMPARISON OF DOMINATION NUMBER OF G AND AN INDUCED SUB GRAPH OF DOMINATION NUMBER OF G TOWARDS A NON-SPLIT DOMINATION NUMBER OF G CORRESPONDING TO I.
... the graph theory. Its basic concept is the dominating set and the domination ...A set D V(G) is said to be a dominating set of G, if every vertex in V-D is adjacent to some vertex in ...
12
Fixed point of set valued graph contractive mappings
... for set-valued ...of set-valued mappings with a gen- eral contractive ...for set-valued graph contractive mappings in metric spaces endowed with a graph ...
7
On A Traffic Control Problem Using Cut-Set of Graph
... control set of the graph at an intersection and show that controlling the minimal edge control set will lead to the optimal control of the traffic system at an intersection in terms of minimal ...
5
Bipartite divisor graph for the set of irreducible character degrees
... Proof. Since each connected component of B(G) is a path, we can see that ∆(G) is triangle-free. We claim that B (G) is disconnected. If B(G) is connected, then Proposition 2 implies that G is solvable and n ≤ 6. This ...
11
Subgraph Matching with Set Similarity in a Large Graph Database
... with set similarity (SMS2) query over a large graph database, which retrieves subgraphs that are structurally isomorphic to the query graph, and during this time period it also satisfy the condition ...
6
Graph CNNs with Motif and Variable Temporal Block for Skeleton-Based Action Recognition
... Skeleton-based Action Recognition. With reliable skele- ton data extracted by robust pose estimation algorithms from depth sensors (Shotton et al. 2011) or a single RGB cam- era (Cao et al. 2017; Xiu et al. 2018), ...
8
FIXED POINTS OF CONTRACTIVE SET VALUED MAPPINGS WITH SET VALUED DOMAINS ON A METRIC SPACE WITH GRAPH
... Let (X, d) be a metric space and ∆ = { (x, x) : x ∈ X } denote the diagonal of the Cartesian product X × X. Consider a directed graph G such that the set of its vertices coincides with X (i.e., V (G) = X) ...
6
The Split Domination, Inverse Domination and Equitable Domination in the Middle and the Central graphs of the Path and the Cycle graphs
... equitable domination number of G. A dominating set D of graph G is called a split dominating set, if the induced subgraph is disconnected. Let denote the greatest integer not greater than and denote ...
6