intTypePromotion=1
ADSENSE

Total graph

Xem 1-20 trên 25 kết quả Total graph
  • We investigate when different graphs associated to commutative rings are chordal. In particular, we characterize commutative rings R with each of the following conditions: The total graph of R is chordal, the total dot product or the zero-divisor dot product graph of R is chordal, the comaximal graph of R is chordal, R is semilocal and the unit graph or the Jacobson graph of R is chordal.

    pdf12p nutifooddau 21-01-2019 7 0   Download

  • It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at least 2pd − 1 cos(  2k ). A similar result has been proved by Friedman using more sophisticated tools.More generally, Serre has shown (see [3], [4] ) that for any fixed r and for any infinite family of d-regular graphs Gi, lim inf r(Gi) 2pd − 1. The same result has been proved by Friedman already in [5].

    pdf4p thulanh5 12-09-2011 76 5   Download

  • Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90% of the total parsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible. We have developed a scheme to attain these two elements without expensive overhead through temporarily modifying graphs during unification to eliminate copying during unification. ...

    pdf8p bunmoc_1 20-04-2013 29 1   Download

  • The minimum number of colors needed for a dominated coloring of G is called the dominated chromatic number of G, denoted by χdom (G). In this paper, dominated coloring of graphs is compared with (open) packing number of G and it is shown that if G is a graph of order n with diam(G) ≥ 3, then χdom(G) ≤ n − ρ(G) and if ρ0(G) = 2n/3, then χdom(G) = ρ0(G).

    pdf9p nutifooddau 21-01-2019 7 0   Download

  • The graphs show enrolment in different colleges in the Higher Colleges of Technology in 1999. Write a total of 150 - 200 words about the information in the three graphs. Write a report for a university lecturer describing the information given. You

    doc2p anhheomap 13-12-2010 136 10   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: Total domination and matching numbers in claw-free graphs...

    pdf28p thulanh6 14-09-2011 45 4   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài:Sharp lower bound for the total number of matchings of tricyclic graphs...

    pdf15p thulanh7 04-10-2011 31 3   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí Department of Mathematic dành cho các bạn yêu thích môn toán học đề tài: Total weight choosability of graphs...

    pdf11p thulanh7 05-10-2011 36 3   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: Edge and total choosability of near-outerplanar graphs...

    pdf7p thulanh6 14-09-2011 40 2   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: A note on neighbour-distinguishing regular graphs total-weighting...

    pdf5p thulanh6 15-09-2011 40 2   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: Total 4-choosability of series-parallel graphs...

    pdf36p thulanh6 14-09-2011 38 1   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: A new upper bound on the total domination number of a graph...

    pdf10p thulanh6 15-09-2011 40 1   Download

  • Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: On the total weight of weighted matchings of segment graphs...

    pdf11p thulanh8 17-09-2011 38 1   Download

  • The test contains three reading passages, which may include pictures, graphs, tables or diagrams. The reading passages are of different length, ranging from approximately 500 to 1,000 words. The total for the three passages is between 1,500 and 2,500 words. Each reading passage has several different types of questions, which may be printed either before or after the passage, Often the texts and the questions become more difficult as you read from Passage 1 to 3.

    pdf10p kathy204 26-07-2010 303 154   Download

  • ADC’s DSX products are designed with features that will improve your company's profitability over alternative DDF technologies. When comparing the DSX and DDF solutions, it is important to assess the total costs of the equipment over the life of the product. In the graph below, the initial purchase price of the DDF solution is significantly less than DSX. However, over the life of the product, the DSX is the lower cost solution.

    pdf4p halanh 14-08-2009 65 3   Download

  • RAM is consumed by TinyDB and forwarding buffers in the networking stack. We have also experimented with several other types of join queries and found similar re- sults: irrespective of the query, join-predicate selectivity and average node depth have the largest effect on query execution cost for the distributed join algorithm. For all graphs showing results for the distributed join al- gorithm, we show power utilization and result accuracy at steady state, after groups have formed and nodes are per- forming the join in-network.

    pdf12p nhacsihuytuan 06-04-2013 41 3   Download

  • Next we examine the relative macroeconomic performance across our sample. As discussed, we extract the first principal component of real GDP growth, which explains 39% of the total variation in growth rates across our sample of 46 economies. Figure 2 graphs the first principal component of global GDP growth, normalised to have a mean of zero and a standard deviation of one. The figure shows the magnitude and timing of the global business cycle from 1998 to 2010.

    pdf16p doipassword 01-02-2013 39 2   Download

  • For an alternative summary of our U.S. return results, Figure 1 presents a graph of new moon vs. full moon annualized mean daily returns for the 15-day specification. In interpreting the graph, it is useful to keep in mind that the returns for the DJIA and the S&P 500 exclude dividends, while dividends comprise the bulk of total stock returns up until the last 30 or 40 years (e.g., Fama and French 2001). Thus, it is not surprising that the returns for the DJIA and the S&P 500 (which start a lot earlier) are lower than those for...

    pdf53p bocapchetnguoi 06-12-2012 42 1   Download

  • Several European cases highlight to varying degrees the roles of direct and indirect crossborder credit in the course of the global credit boom of the 2000s (Graph 1). Direct crossborder credit to non-banks in Ireland (dark shaded area), for example, grew at roughly 40% year on year in the three years prior to the crisis (centre panel), 10 percentage points above the rate for domestic bank credit. Moreover, banks in Ireland drew on indirect cross-border credit (left-hand panel, dashed brown line) to support their domestic lending.

    pdf26p enter1cai 12-01-2013 34 1   Download

  • Indeed, turning back the clock to that period, we see that the credit booms in Asian economies displayed much the same regularity.6 In the run-up to the Asian crisis, direct and indirect cross-border credit grew to account for a combined share of roughly one third of the total credit to non-banks in Indonesia and Thailand, and more than a quarter in Korea (Graph 2). Indonesian firms relied heavily on direct cross-border credit, especially in 1996–97 (albeit not to the same extent as borrowers in Ireland more recently).

    pdf4p enter1cai 12-01-2013 26 1   Download

CHỦ ĐỀ BẠN MUỐN TÌM

TOP DOWNLOAD
70 tài liệu
770 lượt tải
ADSENSE

p_strKeyword=Total graph
p_strCode=totalgraph

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2