degree of a vertex directed graph

... Trang 1A conjecture of Biggs concerning the resistanceof a distance-regular graph gmarkowsky@gmail.com jacobus koolen@yahoo.com Pohang Mathematics Institute Department of Mathematics Republic of ... implies Theorem 1 and shows that the graphs in E are the extremal cases Proof of Theorem 2: The proof proceeds by considering a number of separate cases, and leans heavily on the standard reference ... distance-regular line graphs have been classified, and appear in Theorem 4.2.16 of [4] All such graphs with k > 3 have D 6 2 and are therefore covered by Case 1, with two exceptions First of all,

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

... Trang 1The degree of a q-holonomic sequenceis a quadratic quasi-polynomial Stavros Garoufalidis ∗ School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA stavros@math.gatech.edu ... unable to formulate an analogue of Theorems 1.2 and 1.3 in the differential operator case Indeed, q is a variable whichseems to be independent of the spacial variables x of a differential operator ... using a q-analogue of Hensel’s lemma, analogous tothe case of linear differential operators The first reduction factors an operator with arbitrary Trang 11Newton polygon into a product of operators

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

... sets are derived for a sustained loss of power on one busbar This algorithm is based on a directed graph (digraph) representation of the Fig 1 Single-line diagram of a power supply network All ... devices are system, in contrast with the method of Camarda, et al which is based on labeled and all lines numbered for later referencing. a reliability graph The digraph model forces an explicit evaluation ... hasadequatepower and speed to correct thedisturbance Thedigraphprocessmodelcapturesthecausalrelation- SO+1 S ships betweenvariables includingnormal and failedstates F2 changes intheinputvariable,

Ngày tải lên: 03/01/2014, 19:37

... enzyme deacylated glutaryl-7-ACA with a catalytic con-stant kcatof 8.1 s)1and with a Michaelis constant Kmof 0.08 mM Adipyl-7-ADCA is deacylated at a lower kcatof 0.65 s)1and a higher Kmof 1.2 ... glutaryl acylases [3,11–16] The activity of the glutaryl acylases on substrates with adipyl and a-aminoadipyl side chains varies greatly As the glutaryl, adipyl and a-aminoadipyl side chains are ... Trang 1Directed evolution of a glutaryl acylase into an adipyl acylaseCharles F Sio1, Anja M Riemens2, Jan-Metske van der Laan2, Raymond M.D Verhaert1,* and Wim J Quax1 1 Pharmaceutical Biology,

Ngày tải lên: 31/03/2014, 09:20

... concentration levels of the pharma-ceuticals diclofenac and carbamazepine In contrast, the toxicity of fractions 1, 3, and 4 was probably caused by organic contaminants in additional precipitation ... concentrated under a gentle stream of nitrogen at 30°C to a volume of approximately 100μL For chemical analysis of fraction 2 and for biological analysis of all fractions, the eluates were evaporated ... is a sig-nificant overlap in the extraction spectra of fractions 1 and 2 because Oasis HLB and Chromabond C18ec are partially able to extract the same classes of organic xenobiotics [23,24] A

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

... degree of approximation of a periodic function f by almost Nörlund means Tamkang J Math 12(1), 35 –38 (1981) 12 Qureshi, K, Neha, HK: A class of functions and their degree of approximation Ganita ... (1965)] and Kathal [Riv Math Univ Parma, Italy 10, 33- 38 (1969)] have studied summability of Fourier series by Karamata (Kl) summabilitymethod In present paper, for the first time, we study the degree ... criteria for Karamata summability of Fourier series Riv Math Univ Parma Italy 10, 33 –38 (1969) 6 Ojha, AK: pp 120 –126 Ph.D Thesis, B.H.U (1982) 7 Tripathi, LM, Lal, S: Kλ-summability of Fourier

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

... Massachusetts, 2003. [6] D Goeleven, D Motreanu, Y Dumont, and M Rochdi, Variational and Hemivariational In-equalities: Theory, Methods and Applications Vol I Unilateral Analysis and Unilateral ... Goeleven and D Motreanu, Variational and Hemivariational Inequalities: Theory, Methods and Applications Vol II Unilateral Problems, Nonconvex Optimization and Its Applica-tions, vol 70, Kluwer Academic ... point out a relevant special case ofCorollary 3.6 Trang 9Theorem 3.7 Assume that (H2  ) holds and that(H4)A : H → H is a linear topological isomorphism such that id H − A is a compact map-ping.

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

... appearance of a k-Gallai subgraph In this paper we answer this question in the affirmative: Theorem 1.1 For k ≥ 3 and any  > 0, a.s Gn,M =(ck+)n has a k-Gallai subgraph One implication of ... graph of some (k + 1)-critical graph H, k ≥ 2, iff (a) L has maximum degree at most k; (b) each block of L is either a clique or a chordless odd cycle We say that a graph is k-Gallai if it has ... the degree sequence of L(F ), the low graph of the underlying multigraph of F Each vertex-copy is paired to a vertex-copy of a vertex of degree k with probability kdk/2`n = α Therefore a.s a vertex

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

... Trang 1a random graphAlexis C Kaporis, Lefteris M Kirousis, and Yannis C Stamatiou University of Patras Department of Computer Engineering and Informatics Rio 265 00, Patras, Greece. e-mail: ... of a graph, Dunne and Zito singled out the special colorings that satisfy a maximality condition that, however, is a weaker form of maximality than the one considered in [10] This has as an effect ... such that the change of color of any vertex gives an illegal coloring This idea stems from the analogous local maxima technique for the satisfying truth assignments of a random formula (see [10])

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

... Trang 1A Tur´ an Type Problem Concerning the Powers of theDegrees of a Graph Yair Caro ∗ and Raphael Yuster † Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS ... of prescribed forbidden ∗e-mail: yairc@macam98.ac.il †e-mail: raphy@macam98.ac.il 1 Trang 2subgraphs For a fixed graph H, let t p (n, H) denote the maximum value of e p (G) taken over all graphs ... B ∪ A 0 is a spanning subgraph of H(b + a 0 , k) where |A 0 | = a 0 In particular, if A 0 = A then G is a spanning subgraph of H(n, k). 2 Note that by Corollary 3.7 we have that if A 0 = A then

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

... Trang 1On the Domination Number of a Random GraphBen Wieland Department of Mathematics University of Chicago wieland@math.uchicago.edu Anant P Godbole Department of Mathematics East Tennessee ... p often approaches zero as n → ∞ The treatises of Bollob´as [2] and Janson et al [8] between them cover the theory of random graphs in admirable detail Dreyer [3] generalizes some results of ... dominating set if each v ∈ V is either in γ or is adjacent to a vertex in γ The domination number D of G is the size of a dominating set of smallest cardinality Domination has been the subject of

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

... Trang 1Colouring the petals of a graphDavid Cariolaro ∗ Department of Mathematics University of Reading RG6 6AX U.K. davidcariolaro@hotmail.com Gianfranco Cariolaro Dipartimento di Ingegneria ... vertex, all petal graphs are Class 1 This settles a particular case of a conjecture of Hilton and Zhao ∗corresponding author. Trang 21 IntroductionAll graphs considered in this paper are finite, undirected, ... 29, 2003 Mathematical Subject Classification: 05C15 Abstract A petal graph is a connected graph G with maximum degree three, minimum degree two, and such that the set of vertices of degree three

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

... Classifications: 05C62, 05C83 Abstract An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped ... Definition 2.1 An interval-representation φ of a graph G is a map taking each vertex of G to an interval on the real line R in such a way that adjacent vertices are mapped to intersecting intervals For ... interval-representations φ of G. Arc-width is defined similarly Definition 2.2 An arc-representation φ of a graph G is a map taking each vertex of G to an arc on the unit circle S1 in such a way that adjacent

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

... complexity of a graph Our approach requires only a basic familiarity with adjacency matrices of graphs, and a working knowledge of the linear complexity of a linear transformation An excellent ... linear complexity of any one of its adjacency matrices In other words, the linear complexity of a graph Γ is a measure of how hard it is to compute AX, where A is an adjacency matrix of Γ and ... this paper, we introduce another measure of the complexity of a graph Our mea-sure is the linear complexity of any one of the graph’s adjacency matrices If A is any matrix, then the linear complexity

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

... planar Figure 2 gives a graphical representation of H. In this example, the hamburger matrix M H equals The graph that inspired the definition of a hamburger graph comes from the work of Brualdi ... there are two distinct mathematical objects thathave the name “cycle” We have already mentioned the type of cycle that appears ingraph theory There, a (simple) cycle in a directed graph is a closed ... of an Aztec diamond, an Aztec pillow, and a generalized Aztec pillow Trang 5A key fact that we will use is that any generalized Aztec pillow can be recovered from alarge enough Aztec diamond

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

... least three, manuscript (2006) [11] P C B Lam and B Wei, On the total domination number of graphs Utilitas Math [12] S Thomass´e and A Yeo, Total domination of graphs and small transversals of ... define a vertex as small if it has degree 2, and large if it has degree more than 2 Let G be a connected graph with minimum degree at least two and maximum degree at least three Let S be the set of ... that )-set S that ) Trang 5Observation 3 If G is obtained from a graph G with no isolated vertex by attaching)-set S that ) We define an elementary 4-subdivision of a nonempty graph G as a graph

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

... than two third of the sample rated it at 5. Variety of product lines went as the next important criteria with mean value was nearly 4.28 and half of sample rated it at 5. Convenient and easy assess ... Oriental Emporium, Prime Supermarkets and Yaohan are located in low and medium broad markets. In general, the market is dominated by the “political” NTUC FairPrice chain and a large presence of Japanese players ... Hong Kong and Singapore ã Transitional - Taiwan, South Korea, Thailand and Malaysia ã Traditional - Indonesia, the Philippines, and China Hong Kong’s population of 6.4 million enjoys one of the...

Ngày tải lên: 13/04/2013, 10:30

... 39-year old man suffering with anxiety as a result of residual psychotic symptoms. Clinical Practice Report 5 was an oral presentation of a piece of clinical work completed with staff at a day ... by Mitrofan, Paul and Spencer (2008) and adapted for this review, including the introduction of a numerical numbering system to aid data analysis. As such, a score of 0 denotes no available evidence ... people diagnosed by ESPAGAN guidelines were on gluten containing diet). Rashid, Cranney, Zarkadas, Graham, Switzer, Case, Molloy, Warren, Burrows & Butzner (2005) Canada Canadian...

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

... DCPIP assay, the E1aY28 1A and E1aR28 2A mutants displayed a catalytic activity about twice that of wild-type E1. The single mutants E1aR26 7A and E1aD27 6A and the multiple mutants E1aY28 1A/ R28 2A/ S28 3A ... the active site (Fig. 1), as the main cleavage sites. Cleavage of the E 1a- subunit activated the enzyme, as determined by a decarboxylation assay of the free E1 in the presence of an artificial ... lane 5: E1aR26 7A mutant; lane 6: E1aR26 7A mutant + di-domain; lane 7: E1aD27 6A mutant; lane 8: E1aD27 6A mutant + di-domain. The gels for the other mutants were virtually identical (data not shown)....

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

... (This data was obtained with the commands InvariantRing, PrimaryInvariants, and SecondaryInvariants in Magma.) One checks that R = R/f 1 R is an integral domain. Let S be the subring of R generated ... Belolipetsky, Counting maximal arithmetic subgroups, preprint; available on arXiV as math.GR/0501198. [2] M. Bhargava, The density of discriminants of quartic rings and fields, Ann. of Math. 162 (2005), ... authors are grateful for the hospitality of the American Institute of Mathematics, where the first phase of this work was undertaken. We also thank Hendrik Lenstra for useful comments on an earlier draft. 2....

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