Chromatically Unique Bipartite Graphs With Certain 3-independent Partition Numbers III ABSTRACT
|
|
- Virgil Eaton
- 5 years ago
- Views:
Transcription
1 Malaysian Chromatically Journal of Mathematical Unique Biparte Sciences Graphs with 1(1: Certain Independent (007 Partition Numbers III Chromatically Unique Bipartite Graphs With Certain 3-independent Partition Numbers III 1 Roslan Hasni & Y.H. Peng 1 Pusat Pengajian Sains Matematik Universiti Sains Malaysia, Penang, Malaysia Jabatan Matematik dan Institut Penyelidikan Matematik Universiti Putra Malaysia UPM Serdang, Malaysia hroslan@cs.usm.my, yhpeng@fsas.upm.edu.my ABSTRACT s For integers p, q, s with p q and s 0, let K ( pq denote the set of _ connected bipartite graphs which can be obtained from K(p,q by deleting a set s G K p q with p q 3, of s edges. In this paper, we prove that for any graph, and 1 s q - 1 if the number of 3-independent partitions of G is p-1 + q-1 + s + 4, then G is chromatically unique. This result extends both a theorem by Dong et al. []; and results in [4] and [5]. Keywords : Chromatic polynomial, Chromatically equivalence, Chromatically unique graphs. INTRODUCTION All graphs considered here are simple graphs. For a graph G, let V(G, E(G, δ(g, Δ(G and P(G,λ be the vertex set, edge set, minimum degree, maximum degree and the chromatic polynomial of G, respectively. Two graphs G and H are said to be chromatically equivalent (or simply χ - equivalent, symbolically G ~ H, if P(G, λ = P(H, λ. The equivalence class determined by G under ~ is denoted by [G]. A graph G is chromatically unique (or simply χ- unique if H G whenever H ~ G, i.e, [G] = {G} up to isomorphism. For a set ς of graphs, if [ G] ς for every G ς and ς of graphs, if P( G, λ P( G, λ, then ς is said to be χ closed. For two sets ς1 for every G1 ς and G 1 ς, then ς1 and 1 ς are said to be chromatically disjoint, or simply -disjoint. For integers p, q, s with p q and s 0, let K -s (p,q denote the set of connected (resp. -connected bipartite graphs which can be obtained from K p,q by deleting a set of s edges. Malaysian Journal of Mathematical Sciences 139
2 Roslan Hasni & Y.H Peng For a bipartite graph G = (A, B; E with bipartition A and B and edge set E, let be G =(A,B ;E the bipartite graph induced by the edge set where {,, } E = xy xy E x A y B A where p = A and q = B. A and B B. We write G = K( p, q G In [1], Dong et al. proved the following result. s Theorem 1.1 : For integers p, q, s with p q and 0 s q 1, ( pq closed. Throughout this paper, we fix the following conditions for p, q and s: p q 3 and 1 s q 1. κ is -, For a graph G and a positive integer k, a partition {A 1,A,...A k } of V(G is called a k-independent partition in G if each A i is a non-empty independent set of G. Let (G, k denote the number of k independent partitions in G. For any bipartite graph G = (A, B; E, define A (,3 (,3 ( 1 B G = G + 1 In [1], the authors found the following sharp bounds for (G,3. s Theorem 1.: For G κ ( p, q with p q 3 and 0 s q 1 s ( G s,3 1, where ( G,3 = s iff Δ ( G = 1 and ( G,3 = s 1 iff Δ ( G = s. s For t= 0,1,,..., let B(p, q, s, t denote the set of graphs G K ( p, q (,3 G = s+ t. Thus, K -s (p,q is partitioned into the following subsets: B(p,q,s,0, B(p,q,s,1,..,B (p,q, s, s - s - 1. Assume that B(p, q, s, t = φ for t> s s 1. with Lemma 1.1 : (Dong et al. [] For p q 3 and 0 s q 1,if 0 1 q 1 q 1, then s ( pqst,,, κ ( pq, B. 140 Malaysian Journal of Mathematical Sciences
3 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III Dong et al. [1] have shown that if G is a -connected graph in s B( p, q, s,0 B( p, q, s, s 1, then G is unique. In [], Dong et al. proved that every -connected graph in B(p, q, s, t is unique for 1 t 4. In [4] and [5], we extended this result for t = 5 and t = 6, respectively. In this paper, we prove the chromatic uniqueness of graphs in B (p, q, s, 7. PRELIMINARY RESULTS AND NOTATION For any graph G of order n, we have (see [3]: n (, λ = (, λ( λ 1...( λ + 1 P G G k k k = 1 Thus, we have Lemma.1 : If G ~ H, then (G, k = (H, k for k = 1,,... By Theorem 1.1, the following two results were obtained in []. s Theorem.1 The set ( pqst,,, κ ( pq, Corollary.1 If 0 t q 1 q 1, then ( pqst,,, B is χ closed for all t 0. B is χ closed... Let β i (G, or simply β i denote the number of vertices in G with degree i, n i (G denote the number of i-cycles in G and P n denote the path with n vertices. Then Dong et al. [] established the next two results. Lemma.: For G ( A, B; E κ s ( p, q =, i. if Δ( G, then ( G,3 s β ( ( G n4 G ii if Δ ( G = 3, then ( G,3 s β ( ( G n4 G iff N u N υ for all iii. G G Δ( G G,3 + s 1 Δ G. = + + ; + +, where equality holds u, υ B ; or u, υ B For two disjoint graphs H 1 and H, let H1 H denote the graph with vertex set V ( H and edge set E ( H ( H V H 1 1 and let kh be null if k = 0.. Let kh = 1443 H... H for k 1 k Malaysian Journal of Mathematical Sciences 141
4 Roslan Hasni & Y.H Peng s Lemma.3: Let G κ ( p, q. If (i each component of G is a path and ( (ii ( 3 G K s K 1,3 G,3 = s+ t s+ 4, then either β G = t, or Now for convenience we define the graphs Yn, Z1, Z and Z 3 as in Figure 1. Figure 1: The graphs Y n, Z 1, Z and Z 3 The following result is an extension of Lemma.3. s Lemma.4: Let G κ ( p, q. If ( G,3 = s+ 7, then either i. each component of G is a path and β (G =6, or ii. G K1,3 3P3 ( s 9 K, iii. iv. G K1,3 P5 ( s 8 K, or v. G C4 P3 ( s 8 K, vi. G C4 P4 ( s 7 K, or vii. G C6 P3 ( s 8 K, or viii. G Y3 P4 ( s 7 K, or ix. G Y3 P3 ( s 8 K, x. G Y P ( s 7 K, or or G K P P s 8 K, or 1,3 4 3 or or 4 3 G Y s 6 K, or xi. 5 G Z P s 7 K, or xii. xiii. G Z ( s 6 K xiv. G Z ( s 6 K 1 3, or 3 14 Malaysian Journal of Mathematical Sciences
5 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III Proof. Since ( G,3 = s+ 7, Δ ( G = 3 by Lemma.(iii. If.(ii, we have β ( G = 3, n4( G = 0 and β ( 3 G = 1. Δ G 3, by Lemma Thus G K 3P ( s 9 K or G K1,3 P4 P3 ( s 8 K or 1,3 3 ( 7 or G Y P ( s 7 K or ( 8 G K1,3 P5 s K 3 4 G Y P s K 3 3 or G Y P ( s 7 K or G Y5 ( s 6 Kor ( ( 6 or ( 6 G Z s K ( G n ( G 4 7 G Z P s K or If ( G G Z s K Δ =, we have β + = by Lemma.(i, and thus either G contains no cycles or only have one cycle. Hence, when Δ ( G =, either each component of G is a path, and ( β G = 7, or G K, P3 ( s 8 K, G K, P4 ( s 7 K and ( 8 G C6 P3 s K Lemma.(i. By Lemma.4, we have the following result. s Theorem. : Let G k ( p, q and ( G {,3 = s+ 7, then ( 8 ( 9 G P9 s K, P8 P3 s K, P P s 10 K, P P P s 10 K, P 3P s 10 K, P P s 9 KP P s 9 K,P P s 10 K, 7 4, P 4P s 1 K, P P P s 11 K, P P s 10 K, P P s 11 K,P 3P s 1 K, P 5P s 13 K, P s 14 K, K 3P s 9 K, K P P s 8 K, 3 1,3 3 1,3 4 3 ( 7, ( 8, ( 7 K P s K K P s K K P s K, 1,3 5, 3, 4 ( 8, ( 7, ( 8 C P s K Y P s K Y P s K, Y P s 7 K, Y s 6 K, Z P s 7 K, ( 6, ( 6 } Z s K Z s K 3 where H s i K does not exist if s < i. For a bipartite graph G = (A, B; E, let Malaysian Journal of Mathematical Sciences 143
6 Roslan Hasni & Y.H Peng Ù(G = {Q Q is an independent set in G with Q A φ, Q B φ}. For a bipartite graph G = (A, B; E, the number of 4 independent partitions {A 1,A,A 3,A 4 } in G with Ai Define A or Ai B for all i = 1,, 3,4 is ( A 1 1 ( B ( 3 A 3. A 3 ( 3 B 3. B ! 3! A = ( 1 B ( 1 A B ( ,4 =, s Observed that for G, H K ( p, q, A 1 B 1 A 1 B 1 ( G ( G 1 ( G,4 = ( H,4 iff ( G,4 = ( H,4 The following five lemmas (see [] will be used to prove our main results. s Lemma.5 : For G = ( A, B; E K ( p, q with A = p and B = q, p 1 Q A q 1Q B ( G,4 ( = + + Q Ω( G {{ Q1 Q} Q1 Q Ω G Q1 Q = /},,, 0. d u = Lemma.6 : For a bipartite graph G = ( A, B; E, if uvw is a path in G with and d ( v =, then for any k, G ( G, K = ( G + uv, k + ( G { u, v, w}, k 1 For a bipartite graph G ( A, B; E vertices in Aresp (., B with degree i. Lemma.7: For G B ( p, q, s, t, ( Q Ω ( G G 1 = let βi( G, A ( resp., β i( G, B be the number of p 1 Q A if each component of G is a path, then + q 1 Q B p q p 3 q p 3 q 3 β = s + + t + + G, A. Let p i (G denote the number of paths P i in G., if each component of G is a path, then Lemma.8 : For G B ( p, q, s, t s + t {{ Q1, Q} Q1 Q Ω( G Q1 Q = φ} = t p4 ( G p5 ( G,, Malaysian Journal of Mathematical Sciences
7 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III For G ( p q s t B,,,, define p q p q ( G,4 ( G,4 s( t( = ( s t( s t 1 3t] Observe that for GH, B ( pqst,,,, ( G,4 ( H,4 + + (1 = iff ( G,4 = ( H,4 Lemma.9: For G ( p, q, s, t, " p 3 q 3 ( G = ( β( G A p4( G p5( G B if each component of G is a path, then,4, 3. MAIN RESULT Dong et al. [1] have shown that any -connected graph G is ( pqs,,,0 ( pqs,,, s s 1 connected graph in ( pqst,,, B B is -unique. In [], Dong et al. proved that every - B is -unique for 1 t 4. In [4] and [5], we proved this result for t = 5 and t = 6 respectively. In this section, we shall prove that every - B pqst,,, is -unique for t = 7. connected graph in The following theorem is our main result: Theorem 3.1 : Let p, q and s be integers with p q 3 and 0 s q 1. For every G B ( p, q, s,7, if G is -connected, then G is -unique. s Proof : By Theorem.1, B ( pqst,,, κ ( pq, is -closed for all t 0. Hence, to show that every -connected graph in B ( pqst,,, is -unique, it suffices to show that for every two graphs G and H in B ( pqst,,,, if G H then either ( G,4 ( H,4 or ( G,5 ( H,5. Recall that ( G,4 = ( H,4 iff ( G,4 ( H,4 ( G,4 = ( H,4 iff ( G,4 ( H,4 The set ( pqs,,,7 =. = and B consists of 108 graphs by Theorem., named as G7,1, G7,, G7,3,..., G 7,108 (see Table 1 in [7]. This graphs are shown in this table with the. For each graph G7, i, if every component of values ( G " 7,1,4, ( G7,,4,... ( G7,108,4 G 7,i is a path, then ( G,4 7, i can be obtained by Lemma.9; otherwise, we must find Malaysian Journal of Mathematical Sciences 145
8 Roslan Hasni & Y.H Peng (,4 G7, i by Lemma.5, and then we find ( G,4 7, i T1 = { G7,1, G7,} T = { G7,3, G7,4,..., G7,7} T 3 = { G7,8, G7,9,..., G7,17} = T4 = { G7,18, G7,19,... G7,3} T5 = { G7,4, G7,5,..., G7,31} T6 = { G7,3, G7,33} T7 = { G7,34, G7,35,... G7,37} T8 = { G7,38, G7,39,..., G7,43} T9 = { G7,44, G7,45,... G7,53} T 10 = { G7,54, G7, 55,... G7,63} T11 = { G7,64, G7,65,... G7,67} T1 = { G7,68, G7,69,... G7,73} T13 = { G7,74, G7,75,... G7,81} T14 = { G7,8, G7,83} T15 = { G7,84, G7,85} T16 = { G7,86, G7,87,..., G7,91} T17 = { G7,9, G7,93,..., G7,97} T18 = { G7,98} T19 = { G7,99, G7,100} T 0 = { G7,101, G7,10,..., G7,104 } T 1 = { G7,105, G7,106,..., G7,108} by using Equation ( Malaysian Journal of Mathematical Sciences
9 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III For non-empty sets W 1,W,...,W k of graphs, let η ( WW,,, W = 0 if ( G1, 4 ( G, 4 every two graphs G1 Wi and G W j, where i j The values of ( G,4 7, i 1... k and let 1... for η WW,,, W = 1 otherwise. for i=5,6,7;1,13,...,17;46,47,...,53;8,83,...,108 are not given by Lemma.9, but they can be obtained by Lemma.5 and Equation (1. For example, we show a detailed computation of ( G 4 7,5, below : i. (,4 ( p q 3 3 7,5 4 ( p q ( q p G s Similarly, we obtain ( G7, i,4 = ( s p 3 q 3 s p q p 3 q s 7 s = p q for other values of i as follows (see Table 1 in [7]. p 3 q 1 ii. ( G,4 = ,6 iii. ( G7,7,4 = p 1 q 3 iv. ( G7,1 v. ( G7,13,4 = 18. p 4 q 3,4 = p 4 q vi. ( G7,14,4 = p 4 q 3 vii. ( G, ,15 = p 1 q 4 viii. ( G 7,16,4 = p 3 q 4 ix. ( G 7,17,4 = p 3 q 4 x. ( G7,46,4 = 9. p 4 xi. ( G7,47,4 = 9. p 4 q 3 xii. ( G7,48,4 = 3 9. p 4 q xiii. ( G7,49,4 = p 4 q 3 xiv. ( G7,50,4 = 9 9. p 1 q 4 xv. ( G7,51,4 = p 3 q 4 k Malaysian Journal of Mathematical Sciences 147
10 xvi. ( G7,5 p 3 q 4 xvii. ( G7,53 Roslan Hasni & Y.H Peng,4 = ,4 = p 3 q 4 xiix. ( G7,8,4 = p 4 q 3 xix. ( G7,83,4 = p 1 q 4 xx. ( G, ,84 = p 4 q xxi. ( G7,85,4 = p 3 q 4 xxii. ( G7,86,4 = 3 8. p 4 q xxiii. ( G7,87,4 = p 4 q 3 xxiv. ( G, ,88 = p 1 q 4 xxv. ( G7,89,4 = p 3 q 4 xxvi. ( G, ,90 = p 4 q xxvii. ( G7,91,4 = p 3 q 4 xxviii. ( G7,9,4 = p 3 q 3 xxix. ( G7,93,4= p 3 q 3 xxx. ( G7,94,4 = 4. p 4 q 3 xxxi. ( G7,95 xxxii. ( G7,96 xxxiii. ( G7,97 xxxiv. ( G7,98,4 = p 4 q,4 = p 3 q 4,4 = 6 4. p 3 q 4,4 = 3. p 3 q 1 xxxv. ( G, ,99 = p 4 q xxxvi. ( G7,100,4 = p 3 q 4 xxxvii. ( G, ,101 = p 4 q 3 xxxviii. ( G7,10,4 = p 4 q xxxix. ( G7,103,4 = p 3 q 4 xxxx. ( G7,104, 4 = p 3 q 4 xli. ( G7,105,4 = 1. p 4 q Malaysian Journal of Mathematical Sciences
11 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III xlii. ( G7,106 xliii. ( G7,107 xliv. ( G7,108,4 = 3 1. p 4 q,4 = p 3 q 4 p 3 q 4,4 = Claim 1. η(t 1,T,T 3,...,T 1 =0: Proof of Claim 1. Note that if k (k is an integer 1 is not a factor of x, then h is also not a factor of x for any integer h k. Similarly, if k (k is an integer 1 is a factor of x, then h is also a factor of x for any integer 1 h k. a. For s=6,t 14,T 15 and T 16 are non-empty. Observe that 3 is a factor of G, for 14 G T15 T 16. Hence, b. For s=6, 3 is a factor of ( G,4 34 G T but 3 is not a factor of η T T T =. 14, ( G, for G T 16. Hence, η ( 16 = c. For s 7, ( G,4 G, for + for G T 15 but 3 is not a factor of T T. 15, 0 is odd if G T1 T T4 T6 T7 T9 T10 T1 T14 T19 and even if G T3 T5 T8 T11 T13 T15 T16 T17 T18 T0 T 1. Hence ( T T T T T T T T T T T T T T T T T16 T T18 T T η = d. For s 7, 3 is a factor of factor of ( G,4 39 G, for G T1 T4 T10 T 14 but 3 is not + for G T T6 T7 T9 T1 T 19. Hence η ( T1 T4 T10 T14, T T6 T7 T9 T1 T 19 = 0. e. For s 7, 6 4 is a factor of ( G,4 + 3 for G T 1, is not a factor of G,4 + 3 for, G T and 4 is a factor of G T T. Hence η ( TTT 1, 4, 10 T 14 = 0. f. For s 7, 6 is a factor of ( G,4 + 7for G T 14. Hence g. For s 7, 4 is a factor of ( G,4 1 G,4 + 3 but 6 is not for G,4 + 7 for G T 10 but 6 is not a factor of Gin η T T =. 10, for G,4 + 1 for 7 9 1, but 4 is not for 6. 5 h. For 7, 3 G T19, is not a factor of T T T T and 3 is a factor of G T Hence s is a factor of G, for, for G 7 1 G 9 19, G,4 + 1 η T T T T T T =. G, for 3 G T is not a factor of, T and 3 is a factor of T T. Hence η T, T, T T = G, but 5 is not Malaysian Journal of Mathematical Sciences 149
12 Roslan Hasni & Y.H Peng i. For s 7, 4 is a factor of ( G, for G T. Hence j. For s 7, 3 is a factor of ( G,4 34 factor of ( G,4 34 G, for G T 7 but is not a factor of η T, T = 0. + for G T3 T8 T 15 but 3 is not + for G T 5 T. 11 T 13 T 16 T17 T T0 T 1 Hence ( T T T T T T T T T T T η = k. For s 7, is a factor of ( G,4 18 G, for, 8 + for (, 4 3 G T and 4 is a factor of G T. 15 Hence η ( T3, T8, T 15 = 0. l. For s 7, 3 is a factor of s 7, 3 for is not a factor of 18 G T is not a factor of G, but 5 is not for G,4 + 8 for G T16 T 1 but 3 G,4 + 8 for G T T T T T T. Hence ( m. For s 7, 4 is not factor of ( G,4 1 η T T, T T T T T T = 0. + for G T 1 but it is a factor of ( G,4 + 1 for G T. 16 Hence η ( T16, T 1 = 0. n. For s 7, 4 3 is a factor of ( G,4 + 4 for G T, 17 is not a factor of ( G,4 + 4 for G T T T, and is a factor of ( G,4 + 4 but 4 is not for G T T. Hence 13 0 η T, T T T, T T = 0. o. For s 7, 5 is a factor of G,4 + for, 5 G T. Hence 11 η T5, T11, T 18 = 0. p For s 7, 5 is a factor of ( G,4 ( G,4 for G,4 + for G T is not a factor of, 4 18 G T and 4 is a factor of G,4 + but 5 is not for for G T 13 but 5 is not a factor of G T Hence η T, T = By (a to (p, Claim 1 holds. The remaining work is to compare every two graphs in each T i except T 18 since it contains only one graph. Since this comparison process is standard, long and rather repetitive, we shall not discuss all here. In the following we only show the detail comparisons of every two graphs in T i for i = 1, and 3. The reader may refer to [6] for complete comparisons. 1. T i 1.1. When p = qg, 7,1 G7,. 150 Malaysian Journal of Mathematical Sciences
13 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III 1.. When p>q from Table 1 [7], we can easily see that ( G7,1 ( G7,. T.1. When p = q, G7,3 G7,4, G7,5 G7,7 and Thus, we have ( G7,5, 4 ( G7,6, 4 ( p 3 q ( 3 p q 19 = = + = p 3 q 3 0,,4,4 < 0. ( G7,5, 4 ( G7,3, 4 ( p 3 q ( 3 p 3 q = 19 = p 3. ( G7,5 = ( G7,6 ( G7,3,4,4 <,4. Since ( G7,5,4 = ( G7,6,4, we need to calculate ( G7,5 ( G7,6 using Lemma.6, we have ( G7,5,5 ( G7,6,5,5,5. By ( G7,5 ab 1 1,5 ( G7,5 { a1, b1},4 ( G7,5 { a1, b1, c1},4 = + + { } ( { } G 7,6 + ab 1 1,5 + G7,6 ab 1 1,4 + G7,6 a1, b1, c1,4 ( G7,5 { a1 b1 c1} G7,6 { a1 b1 c1} =,,,4,,,4 since G ab G ab + + and { } { G } 7,5 a1, b1 G7,6 ab 1 1 7, ,6 1 1, ( G7,5 { a1 b1 c1} G7,6 { a1 b1 c1} =,, 4,, 4. Since G { a, b, c } ( p, q 1, s,6 by Lemma.5, we have 7, B and { } G7,6 a1, b1, c1 B p 1, q, s, 6, ( G7,5,5 ( G7,6,5 ( G7,5 { a1 b1 c1} G7,6 { a1 b1 c1} =,,,4,,,4 Malaysian Journal of Mathematical Sciences 151
14 Roslan Hasni & Y.H Peng p 4 q 3 p 5 q 3 p 4 q 4 ( s ( 3( ( = Thus, we have p 5 q 4 s 8 ( s p 3 q 4 p 3 q 5 ( s ( ( p 4 q 5 s 8 ( s q ( s ( s ( s p 5 5 = = q-5 (since p=q. (. When p > q ( G 7,5 > ( G 7,6,5,5.. ( G7,5,4 > ( G7,6,4 ( p 3 q ( 3 p q = 19 = + < p 3 q 3 0, ( G7,6,4 ( G7,3,4 ( 3 p 3 q ( 3 p 3 q = 19 = < q 3 0, ( G7,6,4 ( G7,7,4 ( 3 p 3 q ( p 5 q = 19 = + < p 3 q 3 0, ( G7,3,4 ( G7,4,4 = + < p 3 q 3 0, ( G7,7,4 ( G7,4,4 ( p 1 5 q ( 4 p 4 q = 19 = < q 3 0, 15 Malaysian Journal of Mathematical Sciences
15 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III ( G7,3,4 ( G7,7,4 ( 3 p 3 3 q ( p 5 q = = + = 0, if < 0, if p 3 q p = q+ 1; p q+. Therefore, if p q +, we have ( G7,5 < ( G7,6 < ( G7,3 < ( G7,7 < ( G7,4,4,4,4,4,4 ; And if p=q+1, we have ( G 7,5,4 G7,6,4 G7,3,4 = G7,7,4 ( G7,4,4 Since ( G7,3,4 ( G7,7,4 0 ( G7,3 ( G7,7 < < <. = for the case p=q+1 we need to find,5,5. Since Lemma.6 cannot be used to determine ( G7,3,5 ( G7,7,5, we shall use direct counting. We first need the following definitions. For a graph G and x V ( G, N x or simply N(x denote the set of vertices y let G such that xy E( G G. Since s q 1 p 1, there exist x A and y B such that = and N x B N y = A. Thus, for any 5-independent partition {A 1,A,A 3,A 4,A 5 }, G there are at least two A i and A j with Ai A and Aj B. This means that G has only four types of 5-independent partition. We call G has partition of type k for k=0,1,,3, if there are exactly k A i s with A i G the case for k=1, and 3. Recalled that for GH, K s ( pq,, ( G,5 ( H,5 ( G = ( H,5,5. Let i ( G,5 7,3 and i ( G 7,7,5 where 1 i 3. Ω. For our purpose, we only need to consider = iff denote the number of 5-independent partition of type i, Observe that for GH, κ s ( pq,, ( G,5 ( H,5 ( G ( H = iff,5 =,5. By direct counting, we obtained the following : i. i( G7,3,5 i( G7,7,5 Malaysian Journal of Mathematical Sciences 153
16 Roslan Hasni & Y.H Peng 1 q q q q = q 1 3 ( 3 q 1 q q + ( 1( q ( 1 q q ( 3 3 q q q q q q 3 q = q 5 q 3 3. ii. ( G7,3,5 ( G7,7,5 q 4 q 3 q ( s = ( q 3 q ( q q ( q q ( s 1( q q ( s 4( q q = + q iii. 3( G7,3,5 3( G7,7,5 s 9 s ( s = 7 4( s = s 18. Thus, we have ( G7,3,5 ( G7,7,5 ( ( 1 G7,3,5 1 G7,7,5 G7,3,5 ( G7,7,5 ( 3( G7,3,5 3( G7,7,5 ( q 5 3 q 3 5 ( 34 q 6 ( s 18 = + + = q 5 q 5 q 3 = s T When p = q, G7,8 G7,9, G7,10 G7,11, G7,1 G7,17, G7,13 G7,16, G7,14 G7,15 and 154 Malaysian Journal of Mathematical Sciences
17 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III Thus we have ( G7,8 ( G7,10,4,4 = 0 ( ( G7,8,4 ( G7,1,4 ( 3 p 3 3 q ( p q 18 = p 4 = >0, ( G7,1,4 ( G7,13,4 ( p 4 q ( 3 p q 18 = p 3 q 3 = + (3 = 0, ( G7,1,4 ( G7,14,4 ( p 4 q ( 5 p 3 q 18 = = + = p q 0. ( G7,1 = ( G7,13 = ( G7,14 ( G7,8 = ( G7,10,4,4,4 <,4,4. Hence, we need to compare ( G,5 7,8 with ( G,5 7,10 ( G7, i,5, where 1 i 14 By using Lemma.6, we have ( G7,8,5 ( G7,10,5 and for each pair of ( G7,8 uv 1 1,5 ( G7,8 { u1, v1},4 ( G7,8 { u1, v1, w1},4 = ( G7,10 + uv,5 + ( G7,10 { u, v},4 + ( G7,10 { u, v, w },4 ( G7,8 { u1 v1} G7,8 { u1 v1 w1} =,,4 +,,,4 ( G7,10 { u v} + G7,10 { u v w },,4,,,4 since G7,8 + u1v1 G7,10 + ub ( G7,8 { uv 1 1} G7,10 { u v} =,4,,4 + ( G7,8 { u1 v1 w1} G7,10 { u v w},,,4,,,4 Malaysian Journal of Mathematical Sciences 155
18 Roslan Hasni & Y.H Peng ( G7,8 { u1 v1} G7,10 { u v},,4,,4 = + ( G7,8 { u1 v1 w1} G7,10 { u v w},,,4,,,4. Since {, } B ( 1, 1,,5, { } B G u v p q s 7,8 1 1 G u, v p 1, q 1, s,5, 7,10 {,, } B (, 1, 3,4, { } B G u v w p q s 7, G u, v, w p, q 1, s 3,4, 7,10 and by Lemma.9, we have ( G7,8 { u1 v1} G7,10 { u v},,4,,4 ( G7,8 { u1 v1} G7,10 { u v} =,,4,,4 ( p ( q ( p ( q = = 1, and ( G7,8 { u1 v1 w1} G7,10 { u v w},,,4,,,4 ( G7,8 { u1 v1 w1} G7,10 { u v w} =,,,4,,,4 ( p ( q ( p ( q = 6 11 = 5. Thus, we have ( G7,8 ( G7,10,5,5 = 6> 0. (4 Similarly, by Lemma.6, we have ( G7,1,5 ( G7,13,5 ( G7,1 ab, 5 ( G7,1 { a, b},4 ( G7,1 { a, b, c},4 = ( G ( { } ( { } 7,13 + ab,5 + G7,13 ab,4 + G7,13 a, b, c,4 156 Malaysian Journal of Mathematical Sciences
19 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III ( G7,1 { a b c} G7,13 { a b c} =,,,4,,,4 Since G { } { 7,1 + ab G7,13 + ab, G7,1 a, b G7,13 a, b} ( G7,1 { a b c} G7,13 { a b c} =,,,4,,,4. Since G { a, b, c } ( p, q 1, s,6 7,1 B and { } B G a, b, c p 1, q, s,6, 7,13 by Lemma.5, we have ( G7,1 { a b c} G7,13 { a b c},,,4,,,4 ( G7,1 { a b c} G7,13 { a b c} =,,,4,,,4 p 4 q 3 p 5 q 3 p 4 q 4 ( s ( 4( ( = s 8 p 6 q 3 ( s p 3 q 4 p 4 q 4 p 3 q 5 ( s ( 4( ( s p 5 q 4 ( s q ( s ( s q 6 5 = , (since p = q = > q Similarly, by Lemma.6, we have ( G7,13,5 ( G7,14,5 ( G7,13 a3b3, 5 ( G7,13 { a3, b3 },4 ( G7,13 { a3, b3, c3},4 ( G { } 7,14 + a3b3,5 + G7,14 a3, b3,4 + G7,14 a3, b3, c3,4 = ( { } ( G7,13 { a3, b3, c3} G7,14 { a3 b3 c3} =,4,,,4 Malaysian Journal of Mathematical Sciences 157
20 since Roslan Hasni & Y.H Peng G + a b G + a b, 7,13 3, 3 7, and G7,13 { a3, b3} G7,14 { a3, b3} ( G7,13 { a3, b3, c3},4 ( G7,14 { a3, b3, c3},4. = Since G { a b c } ( p q s 7,13 3, 3, 3 B, 1,, 6 and { } B G a, b, c p 1, q, s,6, 7, by Lemma.5 we have,4 (,,,4 ( G7,13 { a3, b3, c3},4 ( G7,14 { a3, b3, c3},4 ( G7,13 { a3, b3, c3} G7,14 { a3 b3 c3} = p 4 q 3 p 5 q p 4 q 4 ( s ( 3( 3 ( = s 8 p 6 q ( { 1( s 8 30 } p 3 q 4 p 4 q 4 p 3 q 5 ( s ( 3( ( s 8 p 5 q 4 ( s q ( s ( s q 6 5 = (since p = q = > q When p>q from Equation (3, we have ( G7,1, ( G7,13, ( G7,13, 4 ( G7,14, = + < 0, p 3 q 3 p ( 4 q p 3 18 ( 5 4 q = = + < p 3 q 3 0, 158 Malaysian Journal of Mathematical Sciences
21 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III ( G7,14, 4 ( G7,8, 4 p ( 4 q 3 p ( 3 3 q = = < p 4 0, From Equation (, we have ( G7,8, ( G7,10, ( G7,8, 4 ( G7,15, = 0, p ( 3 q 3 p ( 1 q = = + < p 3 q 4 3 0, ( G7,15, 4 ( G7,9, 4 ( p 1 9 q ( 4 p 4 q = 18 = < p q 4 0, ( G7,9, ( G7,11, ( G7,9, 4 ( G7,16, 4 Therefore, 4 4 = 0, p ( 3 q 3 p ( 5 3 q = = + < p 3 q 4 3 0, ( G7,16, 4 ( G7,17, 4 p ( 3 q 4 p ( 6 3 q = = + < p 3 q 3 0. ( G7,1,4 ( G7,13,4 ( G7,14,4 ( G7,8,4 = ( G7,10,4 < < < < ( G7,15 < ( G7,9 = ( G7,11 < ( G7,16 < ( G7,17,4,4,4,4,4. Malaysian Journal of Mathematical Sciences 159
22 Roslan Hasni & Y.H Peng Since ( G7,8,4 = ( G7,10,4 and ( G7,9 ( G7,11 ( G7,8,5 ( G7,10,5 and ( G7,9 ( G7,11 have ( G7,8,5 ( G7,10,5 6 0.,4 =,4, we need to calculate,5,5. Hence,by Equation (4, we = > By using Lemma.6, we have ( G7,9,5 ( G7,11,5 ( G7,9 u3v3,5 ( G7,9 { u3v3},4 ( G7,9 { u3, v3, w3},4 = ( G7,11 + u4v4,5 + ( G7,11 { u4, v4},4 + ( G7,11 { u4, v4, w4},4 ( G7,9 { u3, v3},4 ( G7,9 { u3, v3, w3},4 = + ( G7,11 { u4, v4},4 + ( G7,11 { u4, v4, w4},4 since G7,9 + u3v3 G7,11 + u4, v4 ( G7,9 { u3, v3},4 ( G7,11 { u4, v4},4 = + ( G7,9 { u3 v3 w3} G7,11 { u4 v4 w4},,,4,,,4 + ( G7,9 { u3 v3} G7,11 { u4 v4} =,,4,,4 + ( G7,9 { u3 v3 w3} G7,11 { u4 v4 w4},,,4,,,4. Since G { u, v } ( p 1, q 1, s,5 7,9 3 3 B and { } B G u, v p 1, q, s,5, 7, by Lemmas.5,.7 and.8, we have ( G7,9 { u3 v3} G7,11 { u4 v4},,4,,4 ( G7,9 { u3, v3},4 ( G7,11 { u4, v4},4 p 3 q 3 p 4 q 3 p 4 q 4 ( s ( 5( 3( = = Malaysian Journal of Mathematical Sciences
23 Chromatically Unique Biparte Graphs with Certain 3-Independent Partition Numbers III s 3 p 3 q 3 p 4 q 3 5 ( s ( + + 5( + + p 4 q 4 s = 1. Similarly, since {,, } B ( 1,, 3,4 { } B G u v w p q s and 7, G u, v, w p 1, q, s 3,4, 7, by Lemma.5,.7 and.8, we have ( G7,9 { u3, v3, w3},4 ( G7,11 { u4, v4, w4},4 ( G7,9 { u3, v3, w3},4 ( G7,11 { u4, v4, w4},4 p 3 q 4 p 4 q 4 p 4 q 5 ( s 3( 4( ( = = s p 4 q 5 s + 1 ( + 3 = 5. Thus we have ( G7,9 ( G7,11 p 3 q 4 p 4 q 4 ( s,5,5 = 6> 0. For the remaining working every two graphs in T 4 to T 1, the reader may refer to [6]. This completes the proof of Theorem 3.1. Malaysian Journal of Mathematical Sciences 161
24 Roslan Hasni & Y.H Peng REFERENCES DONG, F.M., K.M. KOH, K.L. TEO, C.H.C. LITTLE and M.D. HENDY Sharp bounds for the numbers of 3-partitions and the chromaticity of bipartite graphs. J. Graph Theory 37: DONG, F.M., K.M. KOH, K.L. TEO, C.H.C. LITTLE and M.D. HENDY Chromatically unique graphs with low 3-independent partition numbers. Discrete Math. 4: READ, R.C. and W.T. TUTTE Chromatic polynomials. In Selected Topics in Graph Theory III, ed. L.W. Beineke and R.J. Wilson, p New York: Academic Press. ROSLAN, H. and Y.H. PENG. Chromatically unique bipartite graphs with certain 3- independent partition numbers. Matematika (accepted for publication. ROSLAN, H. and Y.H. PENG. Chromatically unique bipartite graphs with certain 3- independent partition numbers II. Bull. Malaysian Maths Soc. (accepted for publication. sas.upm.edu.my/~yhpeng/publish/proof t7. pdf sas.upm.edu.my/~yhpeng/publish/tablet7.pdf 16 Malaysian Journal of Mathematical Sciences
Introduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationSynthesis and Characterization of New 2,3-Disubstituted Thieno[3,4-b]pyrazines: Tunable Building Blocks for Low Band Gap Conjugated Materials
SUPPORTING INFORMATION Synthesis and Characterization of New 2,3-Disubstituted Thieno[3,4-b]pyrazines: Tunable Building Blocks for Low Band Gap Conjugated Materials Li Wen, Jon P. Nietfeld, Chad M. Amb,
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationEP elements in rings
EP elements in rings Dijana Mosić, Dragan S. Djordjević, J. J. Koliha Abstract In this paper we present a number of new characterizations of EP elements in rings with involution in purely algebraic terms,
More informationMINISTRIES/DEPARTMENTS Internal and Extra-Budgetary Resources Total. Support Internal ECBs/ Others Total IEBR Resources Bonds Suppliers EBR
I MINISTRY OF AGRICULTURE 2929.55 0.00 2929.55 Department of Agriculture 1950.00 0.00 1950.00 and Cooperation Department of Agricultural 629.55 0.00 629.55 Research & Education D/Animal Husbandry 300.00
More informationA Revised Denotational Semantics for the Dataflow Algebra. A. J. Cowling
Verification and Testing Research Group, Department of Computer Science, University of Sheffield, Regent Court, 211, Portobello Street, Sheffield, S1 4DP, United Kingdom Email: A.Cowling @ dcs.shef.ac.uk
More information500 Delaware Ave. APPENDICES
APPENDICES i APPENDICES APPENDIX A: LOAD CALCULATIONS... iii A.1 Snow Loading...iv A.2 Lateral Loading...vi A.2.1 Wind... vi A.2.2 Seismic...xi APPENDIX B: PRELIMINARY MEMBER DESIGN... xiii B.1 Post-tensioned
More informationChromatically Unique Multibridge Graphs
Chromatically Unique Multibridge Graphs F.M. Dong Mathematics and Mathematics Education, National Institute of Education Nanyang Technological University, Singapore 637616 fmdong@nie.edu.sg K.L. Teo, C.H.C.
More informationFe (III), Co (II), Ni(II), Cu(II) -3,3'-(5- -1,2,4- Co(II), Ni(II) 121
.. -1,2,4-2002 3 .,. -1,2,4- / -. :. 2002. 240.,, - -1,2,4-. (5-, - (), - -3,3-(5--1,2,4- - :, -..,, -,, -. :.. ; -. ; - - ().., 2002.,., 2002 4 3 8 10 1. -1,2,4-, 5--1()-1,2,3,4-14 1.1. -1,2,4-14 1.2.
More informationMethods for Marsh Futures Area of Interest (AOI) Elevation Zone Delineation
PARTNERSHIP FOR THE DELAWARE ESTUARY Science Group Methods for Marsh Futures Area of Interest (AOI) Elevation Zone Delineation Date Prepared: 07/30/2015 Prepared By: Joshua Moody Suggested Citation: Moody,
More informationSummer Review Packet AP Calculus
Summer Review Packet AP Calculus ************************************************************************ Directions for this packet: On a separate sheet of paper, show your work for each problem in this
More informationFactorizations of b n ±1, Up to High Powers. Third Edition. John Brillhart, D. H. Lehmer J. L. Selfridge, Bryant Tuckerman, and S. S. Wagstaff, Jr.
CONTEMPORARY MATHEMATICS 22 Factorizations of b n ±1, b = 2, 3, 5, 6, 7,10, 11, 12 Up to High Powers Third Edition John Brillhart, D. H. Lehmer J. L. Selfridge, Bryant Tuckerman, and S. S. Wagstaff, Jr.
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationDIELECTRIC PROPERTIES OF MIXTURES OF CLAY-WATER-ORGANIC COMPOUNDS
DIELECTRIC PROPERTIES OF MIXTURES OF CLAY-WATER-ORGANIC COMPOUNDS By Birsen Canan ABSTRACT The propagation of an electromagnetic wave through a material is dependent on the electrical and magnetic properties
More informationSurvey of Geometry. Supplementary Notes on Elementary Geometry. Paul Yiu. Department of Mathematics Florida Atlantic University.
Survey of Geometry Supplementary Notes on Elementary Geometry Paul Yiu Department of Mathematics Florida tlantic University Summer 2007 ontents 1 The Pythagorean theorem i 1.1 The hypotenuse of a right
More informationIv roman numerals. Cari untuk: Cari Cari
Cari untuk: Cari Cari Iv roman numerals 29-4-2010 Readers Georgia and Gecko are both curious about clocks. Georgia wrote in to ask, "Why is it that some analog clocks with Roman numerals have '4' as '
More informationBiology IA & IB Syllabus Mr. Johns/Room 2012/August,
Biology IA & IB Syllabus Mr. Johns/Room 2012/August, 2017-2018 Description of Course: A study of the natural world centers on cellular structure and the processes of life. First semester topics include:
More informationTopic 2060 Gibbs Energies; Salt Solutions; Aqueous Mixtures The solubilities of chemical substance j in two liquids l
Topic 6 Gibbs Energies; Salt Solutions; Aqueous Mixtures The solubilities of chemical substance in two liquids l and l (at the same T and p) offers a method for comparing the reference chemical potentials,
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 13: Algorithmic Unsolvability The Halting Problem I In the last lecture we have shown
More informationAnalytical formulas for calculating the extremal ranks and inertias of A + BXB when X is a fixed-rank Hermitian matrix
Analytical formulas for calculating the extremal ranks and inertias of A + BXB when X is a fixed-rank Hermitian matrix Yongge Tian CEMA, Central University of Finance and Economics, Beijing 100081, China
More informationModel for Dredging a Horizontal Trapezoidal Open Channel with Hydraulic Jump
Journal of Mathematics Research; Vol. 4, No. 3; 2012 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Model for Dredging a Horizontal Trapezoidal Open Channel with
More informationRapidity evolution of Wilson lines
Rapidity evolution of Wilson lines I. Balitsky JLAB & ODU QCD evolution 014 13 May 014 QCD evolution 014 13 May 014 1 / Outline 1 High-energy scattering and Wilson lines High-energy scattering and Wilson
More information5 Years (10 Semester) Integrated UG/PG Program in Physics & Electronics
Courses Offered: 5 Years (10 ) Integrated UG/PG Program in Physics & Electronics 2 Years (4 ) Course M. Sc. Physics (Specialization in Material Science) In addition to the presently offered specialization,
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationMAT063 and MAT065 FINAL EXAM REVIEW FORM 1R x
Page NEW YORK CITY COLLEGE OF TECHNOLOGY of the City University of New York R DEPARTMENT OF MATHEMATICS Revised Spring 0 W. Colucci, D. DeSantis, and P. Deraney. Updated Fall 0 S. Singh MAT06 and MAT06
More informationChromaticity of Turán Graphs with At Most Three Edges Deleted
Iranian Journal of Mathematical Sciences and Informatics Vol. 9, No. 2 (2014), 45-64 Chromaticity of Turán Grahs with At Most Three Edges Deleted Gee-Choon Lau a, Yee-hock Peng b, Saeid Alikhani c a Faculty
More informationName :. Roll No. :... Invigilator s Signature :.. CS/B.TECH (NEW)(CSE/IT)/SEM-4/M-401/ MATHEMATICS - III
Name :. Roll No. :..... Invigilator s Signature :.. 202 MATHEMATICS - III Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers
More informationOn Total Domination Polynomials of Certain Graphs
Journal of Mathematics and System Science 6 (2016) 123-127 doi: 10.17265/2159-5291/2016.03.004 D DAVID PUBLISHING S. Sanal 1 and H. E. Vatsalya 2 1. Faculty of Mathematics, Ibri College of Technology,
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationFactors in Graphs With Multiple Degree Constraints
Factors in Graphs With Multiple Degree Constraints Richard C. Brewster, Morten Hegner Nielsen, and Sean McGuinness Thompson Rivers University Kamloops, BC V2C0C8 Canada October 4, 2011 Abstract For a graph
More informationChoice Numbers of Multi-Bridge Graphs
Computer Science Journal of Moldova, vol.25, no.3(75), 2017 Julian Allagan Benkam Bobga Abstract Suppose ch(g) and χ(g) denote, respectively, the choice number and the chromatic number of a graph G = (V,E).
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationSUMMER VACATION ASSIGNMENT (MAY- JUNE 2015) CLASS X
SUMMER VACATION ASSIGNMENT (MAY- JUNE 2015) CLASS X ENGLISH Introduction to Poets and Authors: Make a power point presentation of 10 slides about an author or poet of your choice. The power point presentation
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationI) Simplifying fractions: x x. 1) 1 1 y x. 1 1 x 1. 4 x. 13x. x y xy. x 2. Factoring: 10) 13) 12) III) Solving: x 9 Prime (using only) 11)
AP Calculus Summer Packet Answer Key Reminders:. This is not an assignment.. This will not be collected.. You WILL be assessed on these skills at various times throughout the course.. You are epected to
More informationA THESIS. Submitted by MAHALINGA V. MANDI. for the award of the degree of DOCTOR OF PHILOSOPHY
LINEAR COMPLEXITY AND CROSS CORRELATION PROPERTIES OF RANDOM BINARY SEQUENCES DERIVED FROM DISCRETE CHAOTIC SEQUENCES AND THEIR APPLICATION IN MULTIPLE ACCESS COMMUNICATION A THESIS Submitted by MAHALINGA
More informationVISUALIZATION IN SCIENCE EDUCATION
VISUALIZATION IN SCIENCE EDUCATION Models and Modeling in Science Education VOLUME 1 Series Editor: Professor J. K. Gilbert Institute of Education The University of Reading UK Editorial Board: Professor
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More information!"#$%&'(&)*$%&+",#$$-$%&+./#-+ (&)*$%&+%"-$+0!#1%&
!"#$%&'(&)*$%&",#$$-$%&./#- (&)*$%&%"-$0!#1%&23 44444444444444444444444444444444444444444444444444444444444444444444 &53.67689:5;978?58"@A9;8=B!=89C7DE,6=8FG=CD=CF(76F9C7D!)#!/($"%*$H!I"%"&1/%/.!"JK$&3
More informationOrdinary and Stochastic Di erential Equations Lecture notes in Mathematics PhD in Economics and Business. B. Venturi G. Casula, A.
Ordinary and Stochastic Di erential Equations Lecture notes in Mathematics PhD in Economics and Business B. Venturi G. Casula, A. Pili Contents Part. Di erential Equations v Chapter. Ordinary di erential
More informationTable of Contents Notes: 1. PART I 2. PART II Foreword:
Table of Contents Notes: 1. PART I contains explanations and examples of the puzzle exercises which are found in Part II. 2. PART II contains practice puzzles, check quizzes, and check tests. These are
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationNEW METHODS OF SPECIFIC FLUORINATION
NEW METHODS O SPECIIC LUORINATION D. H. R. BARTON Department of Chemistry, Imperial College, London, S. W.7., U.K. and Research Institute for Medicine and Chemistry, 49 Amherst Street, Cambridge, Mass.,
More information1. 4 2y 1 2 = x = x 1 2 x + 1 = x x + 1 = x = 6. w = 2. 5 x
.... VII x + x + = x x x 8 x x = x + a = a + x x = x + x x Solve the absolute value equations.. z = 8. x + 7 =. x =. x =. y = 7 + y VIII Solve the exponential equations.. 0 x = 000. 0 x+ = 00. x+ = 8.
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationOn classifying Laguerre polynomials which have Galois group the alternating group
Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 On classifying Laguerre polynomials which have Galois group the alternating group par Pradipto Banerjee, Michael Filaseta, Carrie E. Finch
More informationReal-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations
Real-Time Software Transactional Memory: Contention Managers, Time Bounds, and Implementations Mohammed El-Shambakey Dissertation Submitted to the Faculty of the Virginia Polytechnic Institute and State
More informationbe a path in L G ; we can associated to P the following alternating sequence of vertices and edges in G:
1. The line graph of a graph. Let G = (V, E) be a graph with E. The line graph of G is the graph L G such that V (L G ) = E and E(L G ) = {ef : e, f E : e and f are adjacent}. Examples 1.1. (1) If G is
More informationc 2011 JOSHUA DAVID JOHNSTON ALL RIGHTS RESERVED
c 211 JOSHUA DAVID JOHNSTON ALL RIGHTS RESERVED ANALYTICALLY AND NUMERICALLY MODELING RESERVOIR-EXTENDED POROUS SLIDER AND JOURNAL BEARINGS INCORPORATING CAVITATION EFFECTS A Dissertation Presented to
More informationCitation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).
Syddansk Universitet Transversals in 4-uniform hypergraphs Henning, Michael A; Yeo, Anders Published in: Journal of Combinatorics Publication date: 2016 Document version Forlagets udgivne version Document
More informationON THE CHROMATIC POLYNOMIAL OF A CYCLE GRAPH
International Journal of Applied Mathematics Volume 25 No. 6 2012, 825-832 ON THE CHROMATIC POLYNOMIAL OF A CYCLE GRAPH Remal Shaher Al-Gounmeein Department of Mathematics Al Hussein Bin Talal University
More informationThe Coq Proof Assistant
The Coq Proof Assistant Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan October 15, 2018 Bow-Yaw Wang (Academia Sinica) The Coq Proof Assistant October 15, 2018 1 / 59 Outline 1 The
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationSETS. set of natural numbers by N set of integers by Z set of rational numbers by Q set of irrational numbers by T
Chapter SETS. Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions... Set and their representations A set is
More informationMulti-colouring the Mycielskian of Graphs
Multi-colouring the Mycielskian of Graphs Wensong Lin Daphne Der-Fen Liu Xuding Zhu December 1, 016 Abstract A k-fold colouring of a graph is a function that assigns to each vertex a set of k colours,
More informationTransient Analysis of Single Phase Transformer Using State Model
Transient Analysis of Single Phase Transformer Using State Model Rikta Majumder 1, Suman Ghosh 2, Rituparna Mukherjee 3 Assistant Professor, Department of Electrical Engineering, GNIT, Kolkata, West Bengal,
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationC 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 523 535 doi:10.7151/dmgt.1936 C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS R.S. Manikandan Department of Mathematics Bharathidasan University
More informationDating Approximation and Analysis of Select Mars Surface Features
Dating Approximation and Analysis of Select Mars Surface Features ASTR498 Fall 2006 Dr. Hayes-Gehrke Ryan Ashford Jon Croco Leanne Dinverno David Simon Introduction Our objective for this project was to
More informationBIOLOGY YEAR AT A GLANCE RESOURCE ( )
BIOLOGY YEAR AT A GLANCE RESOURCE (2016-17) DATES TOPIC/BENCHMARKS QUARTER 1 LAB/ACTIVITIES 8/22 8/25/16 I. Introduction to Biology Lab 1: Seed Germination A. What is Biology B. Science in the real world
More informationREVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO. 2, , 2016
REVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO., 115-13, 016 COMPUTING THE STRONG ALLIANCE POLYNOMIAL OF A GRAPH W. Carballosa,, J. C. Hernández-Gómez,, O. Rosario, and Y. Torres-Nuñez, Cátedra CONACYT,
More informationPacking and Covering Dense Graphs
Packing and Covering Dense Graphs Noga Alon Yair Caro Raphael Yuster Abstract Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere
More informationDorling fbetw.tex V1-04/12/2012 6:10 P.M. Page xi
Dorling fbetw.tex V1-04/12/2012 6:10 P.M. Page xi List of figures P.1 Born in England, Scotland or Wales Britain 1981 (four levels each), ward map (wards are used to define most other administrative areas
More informationBIOLOGY YEAR AT A GLANCE RESOURCE ( ) REVISED FOR HURRICANE DAYS
BIOLOGY YEAR AT A GLANCE RESOURCE (2017-18) REVISED FOR HURRICANE DAYS DATES TOPIC/BENCHMARKS QUARTER 1 LAB/ACTIVITIES 8/21 8/24/17 I. Introduction to Biology A. What is Biology B. Science in the real
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationURL: Publisher: Elsevier. This document has been downloaded from MUEP (
This is an author produced version of a paper published in Atomic Data and Nuclear Data Tables. This paper has been peer-reviewed but does not include the final publisher proof-corrections or journal pagination.
More informationHomomorphisms of sparse graphs to small graphs
LaBRI Université Bordeaux I France Graph Theory 2009 Fredericia, Denmark Thursday November 26 - Sunday November 29 Flow Let G be a directed graph, A be an abelian group. A-flow A-flow f of G is a mapping
More informationSeventeen generic formulas that may generate prime-producing quadratic polynomials
Seventeen generic formulas that may generate prime-producing quadratic polynomials Marius Coman Bucuresti, Romania email: mariuscoman13@gmail.com Abstract. In one of my previous papers I listed forty-two
More information12.1 The Achromatic Number of a Graph
Chapter 1 Complete Colorings The proper vertex colorings of a graph G in which we are most interested are those that use the smallest number of colors These are, of course, the χ(g)-colorings of G If χ(g)
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationRadiocarbon Dating of Archaeological Materials Excavated at Kaman-Kalehöyük: Second Report
Radiocarbon Dating of Archaeological Materials Excavated at Kaman-Kalehöyük: Second Report Takayuki OMORI and Toshio NAKAMURA Nagoya 1 INTRODUCTION In a previous report (Omori and Nakamura 2006), we presented
More informationSummer Review Packet. for students entering. IB Math SL
Summer Review Packet for students entering IB Math SL The problems in this packet are designed to help you review topics that are important to your success in IB Math SL. Please attempt the problems on
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationVector and Matrix Norms I
Vector and Matrix Norms I Scalar, vector, matrix How to calculate errors? Scalar: absolute error: ˆα α relative error: Vectors: vector norm Norm is the distance!! ˆα α / α Chih-Jen Lin (National Taiwan
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationBalanced Biclique Polynomial of Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-768 Volume, Number 5 (06, pp. 447 4433 Research India Publications http://www.ripublication.com/gjpam.htm Balanced Biclique Polynomial of Graphs
More informationMeasures of Vulnerability The Integrity Family
Measures of Vulnerability The Integrity Family Wayne Goddard University of Pennsylvania 1 Abstract In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced
More informationPrimes of the form ±a 2 ± qb 2
Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 421 430 Primes of the form ±a 2 ± qb 2 Eugen J. Ionascu and Jeff Patterson To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. Reresentations
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationDiscrete Mathematics, Spring 2004 Homework 9 Sample Solutions
Discrete Mathematics, Spring 00 Homework 9 Sample Solutions. #3. A vertex v in a tree T is a center for T if the eccentricity of v is minimal; that is, if the maximum length of a simple path starting from
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationAcyclic orientations of graphs
Discrete Mathematics 306 2006) 905 909 www.elsevier.com/locate/disc Acyclic orientations of graphs Richard P. Stanley Department of Mathematics, University of California, Berkeley, Calif. 94720, USA Abstract
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationTutte Polynomials with Applications
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 6 (26), pp. 4781 4797 Research India Publications http://www.ripublication.com/gjpam.htm Tutte Polynomials with Applications
More informationAlternating cycles and paths in edge-coloured multigraphs: a survey
Alternating cycles and paths in edge-coloured multigraphs: a survey Jørgen Bang-Jensen and Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract A path or cycle
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationFundamentals of Die Casting Design
Fundamentals of ie Casting esign Genick Bar Meir, Ph.. 7449 North Washtenaw Ave Chicago, IL 60645 email:barmeir at gmail dot com Copyright 2009, 2008, 2007, and 1999 by Genick Bar-Meir See the file copying.fdl
More informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More information