Báo cáo toán học: "Identifying Graph Automorphisms Using Determining Sets" pps

... in investigating graph automorphisms and are particularly useful in proving that all automorphisms of a given graph have been found. If a proposed set of automorphisms takes the determining set ... the determining number of the Petersen graph is at least 3. Since we found a determining set of size 3 in Example 1, the determining number of the Petersen graph is 3. 2.2 Fin...

Ngày tải lên: 07/08/2014, 13:21

... \e = (T \e, φ). An X-tree T  is a refinement of T if every X-split of T is an X-split of T  . Graphically speaking, T  is a refinement of T if T can be obtained from T  by contracting edges ... for a collection of characters to identify an X-tree has recently been given in terms of chordal graphs [1]. Example 1.1. Let X = {a, b, c, d, e, f} and let T be the phylogenetic X-tree shown in Fig....

Ngày tải lên: 07/08/2014, 13:21

... 7 For instance, if G is a finite graph having vertex-set V and edge-set E and r(A)isthe number of vertices of G minus the number of connected components of the subgraph having vertex-set V and edge-set ... = 0. Therefore, e is a loop of M/X and hence by (†), χ(M/X; λ) = 0. By applying Theorem 4.1 and using the fact that r(I)=|I|for any I including no broken circuit we obtain χ(M; λ)=  I:k...

Ngày tải lên: 07/08/2014, 06:20

... shaded area represents the hole of the 6-vint, t he 8-vint created using ac and ad is a standard 8- vint, and the 8-vint created using ab and ac is not. Table 2: The results of Section 6.5 Case ... electronic journal of combinatorics 18 (2011), #P70 5 • Consider a 5-vint using Z and a non-rig id level-2 edge (such as the one using Z and B) , and assume that it has a support of 2. The...

Ngày tải lên: 08/08/2014, 14:22

... Computational Linguistics, pages 395–403, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Identifying Text Polarity Using Random Walks Ahmed Hassan University ... 2002) and the semi-supervised learning using harmonic functions approach in (Zhu et al., 2003). Let W be the set of words in our lexicon. We construct a graph whose nodes V are all words in...

Ngày tải lên: 20/02/2014, 04:20

... each ( ) i x ϕ by using a nonlinear supervised kernel distance. probability-based LLE using a probability-based distance [26], locally linear discriminant embedding using a vector translation ... Intell. 24(7), 971–987 (2002) 11. C Shan, S Gong, P McOwan, Robust facial expression recognition using local binary patterns, in IEEE International Conference on Image Processing (ICIP...

Ngày tải lên: 20/06/2014, 20:20

... in human and monkey brains using 18 F- labeled inverse agonist radioligands. J Nucl Med 2010, 51:112-120. 18. Gunn RN, Gunn SR, Cunningham VJ: Positron emission tomography compartmental models. ... binding assay using human endocrine and exocrine pancreatic tissues. In vivo pharmacokinetics and pharmacodynamics [PK/PD] was studied in a porcine model by PET/computed tomography, and th...

Ngày tải lên: 20/06/2014, 21:20

... the graph G p is such that every C 4 -free graph G  ⊃ G  p has maximum degree at most 13m. This implies Theorem 3 since, using the coupling described in the introduction, G ∞ is a C 4 -free graph containing ... a maximal graph in Q. From now on when we refer to a random maximal graph from Q we are using this definition. Note that it is very different from any of the other model...

Ngày tải lên: 07/08/2014, 06:20

... the same class. In general, a poset realizes two graphs simultaneously: one is its upper bound graph and another, its lower bound graph. These graphs may be thought of as two meanings of the poset, ... characterization of upper bound graphs, Congr. Numer. 40 (1983), 189–193. [6] J. R. Lundgren, J. S. Maybee, and F. R. McMorris, Two -graph inversion of competition graphs and upper bound gr...

Ngày tải lên: 07/08/2014, 06:20

... possible density of r-identifying codes in four infinite regular graphs, for small values of r. 1 Introduction Given a connected undirected graph G =(V,E), finite or infinite, we define B r (v), the ball ... there is no r-identifying code in a complete graph. The concept of identifying code was introduced in [15]. It was further studied, for different types of graphs, e.g., in [1]–[4], [6]–[14...

Ngày tải lên: 07/08/2014, 06:23