Báo cáo toán học: "Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs" pdf

Báo cáo toán học: "Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs" pdf

Báo cáo toán học: "Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs" pdf

... electronic journal of combinatorics 14 (2007), #R77 8 Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs ∗ He Chen and Xueliang Li Center for Combinatorics and LPMC-TJKLC Nankai ... Woeginger and S.G. Zhang, Paths and cycles in colored graphs, Australasian J. Combin. 31(2005), 297-309. [5] H. Chen and X.L. Li, Color degree and col...
Ngày tải lên : 07/08/2014, 15:23
  • 14
  • 127
  • 0
Báo cáo toán học: "The Neighborhood Characteristic Parameter for Graphs" pptx

Báo cáo toán học: "The Neighborhood Characteristic Parameter for Graphs" pptx

... journal of combinatorics 10 (2003), #R20 3 3 An Euler-Poincar´e-type Theorem This section develops machinery for the Euler-Poincar´e-like Theorem 4, a formula for calculating N char(G) in terms of, ... consisting of 4-cycles. For instance, the cube has β N 0 = 1 since it is connected, β N 1 = 0 since the circuit space has a basis consisting of (any five) 4-cycles, β N 2 = 1 since the s...
Ngày tải lên : 07/08/2014, 07:21
  • 7
  • 330
  • 0
Báo cáo toán học: "The Gr¨tzsch Theorem for the hypergraph of o maximal cliques" pdf

Báo cáo toán học: "The Gr¨tzsch Theorem for the hypergraph of o maximal cliques" pdf

... strong 3-coloring c 1 of H(G 1 ) extending c. This 3-coloring induces a 3-coloring c  of H(C  ), since c 1 is strong. If C  = C,thenInt(C  ) is smaller than G. Therefore, by the induction hypothesis, ... 3-coloring of H(Int(C  )). Since every 3-cycle of G is either in G 1 or in Int(C  ), this gives rise to a strong 3-coloring of H(G) extending c. Suppose now that C  = C.ThenGhas n...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 301
  • 0
Báo cáo toán học: "A Note on the Number of Hamiltonian Paths in Strong Tournaments" ppsx

Báo cáo toán học: "A Note on the Number of Hamiltonian Paths in Strong Tournaments" ppsx

... values for n congruent to 0 and 2 modulo 3. A tournament T =(V, A) is an oriented complete graph. Let h p (T )bethenumber of distinct hamiltonian paths in T (i.e., directed paths that include ... h p (n) be the minimum number of distinct hamiltonian paths in a strong tournament of order n ≥ 3. Then α n−1 ≤ h p (n) ≤            3 ·β n−3 ≈ 1.026 · β n−1 for n ≡ 0mod3 β...
Ngày tải lên : 07/08/2014, 13:21
  • 4
  • 335
  • 1
Báo cáo toán học: "Certificates of factorisation for a class of triangle-free graphs" docx

Báo cáo toán học: "Certificates of factorisation for a class of triangle-free graphs" docx

... exist. Acknowledgement We thank Yingying Wen for her help in translating [4]. References [1] G.H. Birkhoff. A determinant formula for the number of ways of coloring a map. Ann. of Math., 14:42–46, ... can obtained by adding a single edge to, or removing a single edge from, a clique-separable graph. In this paper we construct an in nite family of strongly non-clique-separable graphs. G...
Ngày tải lên : 07/08/2014, 21:21
  • 14
  • 232
  • 0
Báo cáo hóa học: " Research Article Clock Estimation for Long-Term Synchronization in Wireless Sensor Networks with Exponential Delays" docx

Báo cáo hóa học: " Research Article Clock Estimation for Long-Term Synchronization in Wireless Sensor Networks with Exponential Delays" docx

... same intersection of curves in (12). In this case, φ c,b <φ s,b since v c <v s . (ii) The sign change for φ s,b occurs at an intersection (say intersection 2 in Figure 2) of the curves in ... the estimation of clock param- eters using a quadratic model is computationally more de- manding than using the linear model, it helps in maintain- ing long- term synchronization among...
Ngày tải lên : 22/06/2014, 19:20
  • 6
  • 301
  • 0
Báo cáo hóa học: " A Practical Radiosity Method for Predicting Transmission Loss in Urban Environments" pdf

Báo cáo hóa học: " A Practical Radiosity Method for Predicting Transmission Loss in Urban Environments" pdf

... of antenna cylinder is enough for simulating the main lobe, but 16 dB gain must be counted in calculation. For the simulation of antenna subsidiary lobs, two surfaces neigh- boring the directional ... 2004:2, 357–364 c  2004 Hindawi Publishing Corporation A Practical Radiosity Method for Predicting Transmission Loss in Urban Environments Ming Liang Research Center of Information El...
Ngày tải lên : 23/06/2014, 00:20
  • 8
  • 336
  • 0
Báo cáo toán học: " Highly selective fluorescent chemosensor for Zn2+ derived from inorganic-organic hybrid magnetic core/shell Fe3O4@SiO2 nanoparticles" pot

Báo cáo toán học: " Highly selective fluorescent chemosensor for Zn2+ derived from inorganic-organic hybrid magnetic core/shell Fe3O4@SiO2 nanoparticles" pot

... nanoparticles for detecting lead in living cells. Chem Eur J 2010, 16:11549. 31. Park M, Seo S, Lee IS, Jung JH: Ultraeffcient separation and sensing of mercury and methylmercury ions in drinking water ... zinc sensor of carboxamidoquinoline with an alkoxyethylamino chain as receptor. Org Lett 2008, 10:473. 18. Komatsu K, Urano Y, Kojima H, Nagano T: Development of an iminocoumari...
Ngày tải lên : 20/06/2014, 20:20
  • 24
  • 278
  • 0
Báo cáo toán học: " Optimized spectrum sensing algorithms for cognitive LTE femtocells" pdf

Báo cáo toán học: " Optimized spectrum sensing algorithms for cognitive LTE femtocells" pdf

... sensing after the coarse sensing. It is quite clear that the fine sensing module has improved the spectrum sensing performance. It also shows the gain of using the P-SCH correlation fine sensing ... showing the effect of FFT coarse sensing module alone versus using the fine CP correlation sensing after the coarse sensing for a 2.5 m sensing duration. FWT coarse sensing module is also invest...
Ngày tải lên : 20/06/2014, 20:20
  • 19
  • 296
  • 0

Xem thêm

Từ khóa: