The g-extra Conditional Diagnosability of Folded Hypercubes
|
|
- Cecily Townsend
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Sciences, Vol. 9, 2015, no. 146, HIKARI Ltd, The -Extra Conditional Dianosability of Folded Hypercubes Weipin Han Collee of Mathematics and Information Science Henan Normal University, China Shiyin Wan Collee of Mathematics and Information Science Henan Normal University, China Copyriht c 2015 Weipin Han and Shiyin Wan. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the oriinal work is properly cited. Abstract Dianosability plays a crucial role in measurin the reliability and fault tolerance of interconnection networks. The -extra conditional dianosability of multiprocessor systems is a new dianosability, which is more accurate than the classical dianosability. In this paper, we show that the -extra conditional dianosability t (F Q n ) of the folded hypercube F Q n is ( + 1)n ( + 1 under the PMC model and the MM model in some cases, which is several times larer than the classical dianosability of folded hypercubes. Mathematics Subject Classification: 05C90 Keywords: interconnection networks, folded hypercubes, dianosability 1 Introduction As an underlyin topoloy of a multiprocessor system, an interconnection network is usually modeled by a connected raph G, whose vertices represent processors and edes represent communication links. The process of identifyin faulty processors is called the dianosis of the system. Dianosability is
2 7248 Weipin Han and Shiyin Wan defined as the maximum number of faulty processors which the system can uarantee to identify, which is an important parameter to measure the reliability and fault-tolerance of a multiprocessor system. The hypercube structure [8] is a well-known interconnection network model for multiprocessor systems. As a variant of the hypercube, the folded hypercube [3] can be constructed from an n-dimensional hypercube by addin 2 n 1 edes, called complementary edes. The n-dimensional folded hypercube F Q n has recently received considerable attention [3], [4], [10], [12], [13]. The PMC model [7] and the MM model [6] are two widely adopted as the fault dianosis model. In 2015, Zhan et al. [11] defined -extra conditional dianosability under assumption that every component of G F has at least + 1 vertices, where F is a faulty subset of G. Moreover, they also obtained -extra conditional dianosability results for hypercubes under the PMC model and the MM model. In this paper, we show that the -extra conditional dianosability t (F Q n ) of the folded hypercube F Q n is ( + 1)n ( + 1 under the PMC model and the MM model in some cases, which is several times larer than the classical dianosability of folded hypercubes. For raph-theoretical terminoloy and notation not defined here we follow [1]. Definition 1.1 ([11]) A system G is -extra conditionally t-dianosable if and only if for each pair of distinct faulty -extra vertex subsets F 1, F 2 V (G) such that F 1 t, F 2 t, F 1 and F 2 are distinuishable. The -extra conditional dianosability of G, denoted as t (G), is the maximum value of t such that G is -extra conditionally t-dianosable. 2 Results Lemma 2.1 ([10]) Let A be a subraph of F Q n with V (A) = +1 n 1 for n 4 and 0 n 4. Then N F Qn (V (A)) ( + 1)(n + 1) 2 (. Lemma 2.2 ([10]) Let F Q n = D 0 D1, where n 8 and 0 n 4, and let A D 1 and A = K 1,. Then the followin two statements hold: (i) N F Qn (V (A)) = (+1)(n+1) 2 (, (ii) F Qn C F Qn (V (A)) is a connected subraph of F Q n with at least + 1 vertices. Lemma 2.3 ([10]) κ (F Q n ) = ( + 1)(n + 1) 2 (, for n 8 and 0 n 4. Lemma 2.4 ([12]) Any two vertices in V (F Q n ) exactly have two common neihbors for n 4 if they have. Lemma 2.5 ([2]) For a system G and any two distinct subsets F 1 and F 2 of V, F 1 and F 2 are distinuishable under the PMC model if and only if there exist two vertices u V \(F 1 F 2 ) and v F 1 F 2 such that (u, v) E(G).
3 The -extra conditional dianosability of folded hypercubes 7249 Lemma 2.6 ([9]) For a system G and any two distinct subsets F 1 and F 2 of V, F 1 and F 2 are distinuishable under the MM model if and only if at least one of the followin conditions is satisfied: (i). There are three vertices u, w V (G) \ (F 1 F 2 ) and v F 1 F 2 such that uw E(G), vw E(G). (ii). There are three vertices u, v F 1 \ F 2 and w V (G) \ (F 1 F 2 ) such that uw E(G), vw E(G). (iii). There are three vertices u, v F 2 \ F 1 and w V (G) \ (F 1 F 2 ) such that uw E(G), vw E(G). Lemma 2.7 Assume that n 8 and 0 n 4. Then t (F Q n ) ( + 1)n ( + 1 under the PMC model and the MM model. Proof. Suppose that A is a connected subraph of F Q n, A D 1 and A = K 1,. Let F 1 = N F Qn (V (A)) and F 2 = C F Qn (V (A)). Then, by Lemma 2.2, F 1 = (+1)(n+1) 2 ( ) 2, F2 = (+1)n ( +2, and F Qn C F Qn (V (A)) is a connected subraph of F Q n with at least + 1 vertices. Thus, F 1 ( + 1)n ( ) 2 + 2, F2 ( + 1)n ( + 2, and both F1 and F 2 are -extra vertex subsets. Since there is no ede between F 1 F 2 and V (F Q n )\(F 1 F 2 ), by Lemmas 2.5 and 2.6, F 1 and F 2 are indistinuishable under the PMC model and the MM model. By Definition 1.1, t (F Q n ) ( + 1)n ( + 1 under the PMC model and the MM model. This completes the proof. Lemma 2.8 Assume that n 8 and 0 n 4. Then t (F Q n ) ( + 1)n ( + 1 under the PMC model. Proof. By contradiction. Suppose that t (F Q n ) ( + 1)n (. Let F1 and F 2 be two distinct -extra faulty vertex subsets of F Q n, such that F 1 ( +1)n ( ) 2 +1, F1 ( +1)n ( +1, and F1 and F 2 are indistinuishable under the PMC model. Let Φ n () = ( + 1)n ( + 1, where n 8 and 0 n 4. Then Φ n () is strictly monotonic increasin for 0 n 4. Therefore, V (F Q n ) F 1 F 2 = V (F Q n ) F 1 F 2 + F 1 F 2 2 n 2[(+ 1)n ( ) 2 +1] 2 n 2[(n 4+1)n ( ) n ] = 2 n (n 2 +3n 18). Whereby n 8, then V (F Q n ) F 1 F 2 > 0. Therefore, V (F Q n )\(F 1 F 2 ). Since F 1 and F 2 are indistinuishable under the PMC model, and by Lemma 2.5, there is no ede between F 1 F 2 and V (F Q n )\(F 1 F 2 ). So all neihbors of vertices in F 1 F 2 and V (F Q n )\(F 1 F 2 ) are located in F 1 F 2. Thus, the neihbors of all these vertices in the components of F Q n [F 1 F 2 ] and F Q n [V (F Q n )\(F 1 F 2 )] are located in F 1 F 2. By the definitions of F 1 and F 2, we conclude that every component of F Q n F 1 and F Q n F 2 has at least + 1 vertices. If F 1 F 2 is deleted, then F Q n F 1 F 2 will be disconnected and all the components of F Q n F 1 F 2 have at least + 1 vertices. Thus, F 1 F 2 is a -extra vertex cut of F Q n. By Lemma 2.3, we conclude that
4 7250 Weipin Han and Shiyin Wan F 1 F 2 ( + 1)(n + 1) 2 (. Notin that F1 F 2, without loss of enerality, we assume that F 2 \F 1. Observin that F 1 is a -extra vertex cut, thus every component of F Q n F 1 has at least +1 vertices. Since F 2 \F 1 is not connected with V (F Q n )\(F 1 F 2 ), every component of F Q n [F 2 \F 1 ] has at least + 1 vertices, i.e., F 2 \F Hence F 2 = F 2 \F 1 + F 1 F ( + 1)(n + 1) 2 ( ( = ( + 1)n + 2, which contradicts to F 2 ( + 1)n ( + 1. This completes the proof. Lemma 2.9 Let n 32, 3 n and F be a -extra faulty vertex subset 4 of F Q n. If F Q n F has at most n vertices of deree 1, then t 2 (F Q n ) ( + 1)n ( + 1 under the MM model. Proof. By contradiction. Suppose that the -extra conditional dianosability of F Q n t (F Q n ) ( + 1)n ( under the MM model. Assume that there exist two distinct -extra faulty vertex subsets F 1 and F 2, such that F 1 ( + 1)n ( ) 2 + 1, F2 ( + 1)n ( + 1, every component of F Qn F 1 and F Q n F 2 has at most n vertices of deree 1, and F 2 1 and F 2 are indistinuishable under the MM model. Whereby n 32, then n < n 4. Since Φ 4 n() = (+1)n ( +1 is strictly monotonic increasin for 0 n 4, V (F Qn ) F 1 F 2 = V (F Q n ) F 1 F 2 + F 1 F 2 2 n 2[( + 1)n ( + 1] > 2 n 2[(n 4 + 1)n ( ) n ] > 0. So V (F Qn )\(F 1 F 2 ). Claim 1. There is no isolated vertex in F Q n (F 1 F 2 ). Assume that S is a set of all the isolated vertices in F Q n (F 1 F 2 ). For any vertex w S, N F Qn (w) F 1 F 2. We prove that F 1 \F 2 and F 2 \F 1. If F 2 \F 1 =, then N F Qn (w) F 1. Then w is an isolated vertex in F Q n F 1 and so = 0, a contradiction. Similarly, F 1 \F 2. Assume that there exist two distinct vertices u 1, v 1 F 2 \F 1 such that u 1 w, v 1 w E(F Q n ), by Lemma 2.6 (iii), F 1 and F 2 are distinuishable, a contradiction. If there exists no vertex u 1 F 2 \F 1 such that u 1 w E(F Q n ), then N F Qn (w) F 1 and so w is an isolated vertex of F Q n F 1. Thus = 0, a contradiction. Therefore, N F Qn (w) (F 2 \F 1 ) = 1. Similarly, N F Qn (w) (F 1 \F 2 ) = 1. Since F Q n is (n + 1) reular, N F Qn (w) (F 1 F 2 ) = N F Qn (w) N F Qn (w) (F 1 \F 2 ) N F Qn (w) (F 2 \F 1 ) = n = n 1. Thus F 1 F 2. If F Q n F 1 has at most n vertices of deree 1, then S n. Let F 2 2 1\F 2 = p, F 2 \F 1 = q and V = (F 1 F 2 ) S. Then V = p + q + S and p, q 1. We prove that N F Qn (V ) F 1 F 2. If F 1 F 2 S = V (F Q n ), then N F Qn (V ) F 1 F 2. If F 1 F 2 S V (F Q n ), then let R = V (F Q n )\(F 1 F 2 S), then R. Observin that all the isolated vertices of F Q n F 1 F 2 are included in S, so there is no isolated vertex in F Q n [R]. We claim that there is no ede between F 1 F 2 and R. Otherwise, notin that F Q n [R] has no isolated vertex, thus there exists an ede uv in F Q n [R] such that u(v) is adjacent to some vertex in F 1 F 2. By Lemma 2.6 (i), F 1 and F 2 are distinuishable, a contradiction. Since S is a set of all the isolated vertices in F Q n F 1 F 2, we conclude that
5 The -extra conditional dianosability of folded hypercubes 7251 there is no ede between S and R. Furthermore, there is no ede between V and R. Therefore, N F Qn (V ) F 1 F 2 Case 1. S > 2. Subcase 1.1. Either p + 1 or q + 1. Without loss of enerality, suppose p + 1. For an arbitrary vertex w S, N F Qn (w) (F 1 F 2 ) = N F Qn (w) N F Qn (w) (F 1 \F 2 ) N F Qn (w) (F 2 \F 1 ) = (n+1) 1 1 = n 1. By Lemma 2.4, F 1 F 2 (n 1) S 2 ( ) S 2. Let S = t, then h n ( S ) = h n (t) = (n 1)t 2 ( t = t 2 + nt, and h n ( S ) is strictly monotonic increasin for 2+1 S n. Thus, F 2 1 F 2 h n (2+1). Since F 2 = F 2 \F 1 + F 1 F 2 = q + F 1 F 2 and F 2 ( + 1)n ( + 1, F 1 F 2 (+1)n ( ( +1 q (+1)n ( +1 (+1) = (+1)n. Therefore, h n (2 + 1) F 1 F 2 ( + 1)n (. If n 32 and 3 n 2n 8, then n. Thus, h n(2 + 1) [( + 1)n ( ] = (n 1)(2 + 1) 2 ( ) ( [( + 1)n ] = (2n 7 7) > 0, 2 2 a contradiction. Subcase 1.2. p and q. Since V = (F 1 F 2 ) S = F 1 \F 2 + F 2 \F 1 + S = p + q + S and S n, V 1 = p + q + S n (n 1 = 2 +. Whereby n (n, i.e., 4 n 0, then (2 + ) (n 1) = 1 (4 n) So V (n n 1. Since p 1, q 1 and S > 2, 2 V 1 = p+q+ S 1 > p+q > 2. Then 2 < V 1 n 1. Let f n () = (+1)(n+1) 2 (, then fn () is strictly monotonic increasin when 0 n 1. Since N F Qn (V ) F 1 F 2, by Lemma 2.1, F 1 F 2 N F Qn (V ) ( V 1+1)(n+1) 2( V 1) ( ) V 1 2 > (2+1)(n+1) 4 ( 2 ) 2. Since n 32 and 3 n < (2n 3), F F 2 [( + 1)n ( + 1] > [(2 + 1)(n + 1) 4 ( ) ( 2 2 ] [( + 1)n ) 2 + 1] = (2n 3 3) > 0. Therefore, 2 F 2 = F 2 \F 1 + F 1 F 2 = q+ F 1 F 2 > 1+(+1)n ( ( +1 > (+1)n +1, a contradiction. Case 2. S 2. If n 32, then 3 n < n 4. Let I 4 n() = ( + 1)n + ( + 1, then I n () is strictly monotonic increasin for 3 < n 4. Therefore, V (F Q n ) F 1 F 2 S 2 n 2[(+1)n ( +1] 2 > 2 n 2[(n 4+1)n+ n 4 ( ) n ] = 2 n (n 2 +5n 26) > 0. So R = V (F Q n )\(F 1 F 2 S). Since all the isolated vertices are in S, there is no isolated vertex in F Q n [R]. Then there exists one ede uv E(F Q n [R]). If u(v) is adjacent to some vertex in F 1 F 2, then by Lemma 2.6 (i), F 1 and F 2 are distinuishable, a contradiction. If there is a vertex u(v) R which is adjacent to some vertex w in S, and let u 0 N F1 F 2 (w). By Lemma 2.6 (i), F 1 and F 2 are distinuishable, a contradiction. Thus there exists no ede between V and R. Moreover, there exists no ede between (F 1 \F 2 ) S and R, and there exists no ede between (F 2 \F 1 ) S and R. Therefore, N F Qn (R) F 1 F 2. Since every component
6 7252 Weipin Han and Shiyin Wan of F Q n F 1 and F Q n F 2 has at least + 1 vertices, we conclude that every component of F Q n [R], F Q n [(F 1 \F 2 ) S] and F Q n [(F 2 \F 1 ) S] has at least + 1 vertices. We claim that every component of F Q n [V ] has at least + 1 vertices. If every component of F Q n [F 2 \F 1 ] has at least +1 vertices, then the claim holds because every component of F Q n [(F 1 \F 2 ) S] has at least + 1 vertices. Suppose that there is a component C 0 of F Q n [F 2 \F 1 ] with less than + 1 vertices. If there exists no ede between V (C 0 ) and (F 1 \F 2 ) S, then C 0 is also a component of F Q n [(F 2 \F 1 ) S], a contradiction. Thus there exists at least one ede between V (C 0 ) and (F 1 \F 2 ) S. Without loss of enerality, we assume that uv is an ede between V (C 0 ) and (F 1 \F 2 ) S, such that u V (C 0 ) and v V (C 1 ), where C 1 is a component of F Q n [(F 1 \F 2 ) S]. Since every component of F Q n [(F 1 \F 2 ) S] has at least + 1 vertices, there are at least + 1 vertices in C 1. Assume that C 2 is an arbitrary component of F Q n [V ], such that F Q n [V (C 0 ) V (C 1 )] is a connected subraph of C 2, then there are at least + 1 vertices in C 2. Therefore, every component of F Q n [V ] has at least + 1 vertices. Observin that every component of F Q n [V ] and F Q n [R] has at least + 1 vertices, and there is no ede between V and R, thus F 1 F 2 is a -extra vertex cut of F Q n. By Lemma 2.3, we have F 1 F 2 ( + 1)(n + 1) 2 (. Assume q = F 2 \F 1 + 1, then F 2 = F 2 \F 1 + F 1 F 2 = q + F 1 F ( + 1)(n + 1) 2 ( ( = ( + 1)n ( + 2 > ( + 1)n + 1, a contradiction. So q. Similarly, p. Since there exists no ede between (F 2 \F 1 ) S and R, and every component of F Q n F 1 has at least +1 vertices, every component of F Q n [(F 2 \F 1 ) S] has at least +1 vertices. Thus, +1 (F 2 \F 1 ) S = F 2 \F 1 + S = q + S. Similarly, +1 p+ S. Let r = min{p, q}, then + 1 min{p + S, q + S } = r + S. So r S 1. Since N F Qn (V ) F 1 F 2 and V = p + q + S, by Lemma 2.1, F 1 F 2 N F Qn (V ) (p+q+ S 1+1)(n+1) 2(p+q+ S 1) ( ) p+q+ S 1 2. Notin that n and S 2, thus + r = r + r + ( r) p + q + r 4 p+q+ S 1 2+ S n 1. Since f n () = (+1)(n+1) 2 ( ) 2 is strictly monotonic increasin for 0 n 1, F 1 F 2 (p + q + S 1 + 1)(n+1) 2(p+q + S 1) ( ) ( p+q+ S 1 2 ( +r +1)(n+1) 2( +r) +r ) 2. Since F 2 (+1)n ( ) 2 +1, 0 F2 [(+1)n ( +1] = F1 F 2 + F 2 \F 1 [(+1)n ( ) ( 2 +1] (+r+1)(n+1) 2(+r) +r ) ( 2 +r (+1)n+ ) 2 1 = nr 1 2 r2 r + 1r = (n+ 1)r [(1+r) r2 ]. So (1+r)+ 1 2 r2 (n+ 1)r, 2 i.e., 2 + 2r + r 2 2nr + r. Whereby 3 n, then n 4. So r + r 2 2 4r + r, which implies that r r + r. Notin that p, q and r = min{p, q}, so r. Since r + 2 r r + r, 2 5r+r = (5+1)r, 2 r 5+1 = Whereby r 1, then 2 r 2 < 5+ 1, a contradiction. Therefore S =. This completes the proof of Claim 1. By Claim 1, there is no isolated vertex in F Q n [V (F Q n )\(F 1 F 2 )]. That is to say, for any vertex u 1 V (F Q n )\(F 1 F 2 ), there exists one vertex
7 The -extra conditional dianosability of folded hypercubes 7253 v 1 V (F Q n )\(F 1 F 2 ) which is adjacent to u 1. Assume that there exists one vertex w F 1 F 2 that is adjacent to u 1. By Lemma 2.6 (i), F 1 and F 2 are distinuishable, a contradiction. So there exists no ede between F 1 F 2 and V (F Q n )\(F 1 F 2 ). Since both F 1 and F 2 are -extra vertex subsets, every component of F Q n [F 1 \F 2 ], F Q n [F 2 \F 1 ] and F Q n [V (F Q n )\(F 1 F 2 )] has at least + 1 vertices. Hence, all the neihbors of the vertices in F 1 F 2 and V (F Q n )\(F 1 F 2 ) are located in F 1 F 2. If we delete F 1 F 2, then F Q n F 1 F 2 will be disconnected and all components of F Q n F 1 F 2 have at least + 1 vertices. Therefore, F 1 F 2 is a -extra vertex cut of F Q n. By Lemma 2.3, F 1 F 2 ( + 1)(n + 1) 2 (. Since every component of F Q n [F 2 \F 1 ] has at least + 1 vertices, F 2 \F Hence, F 2 = F 2 \F 1 + F 1 F 2 +1+( +1)(n+1) 2 ( = ( +1)n ( +2, a contradiction. The proof is completed. By Lemmas 2.7, 2.8, 2.9, we have the -extra conditional dianosability of F Q n as follows: Theorem 2.10 Assume that n 8 and 0 n 4. Then t (F Q n ) = ( + 1)n ( + 1 under the PMC model. Theorem 2.11 Assume that n 32 and 3 n. If F Q 4 n F has at most n vertices of deree 1, where F is a -extra vertex subset of F Q 2 n, then t (F Q n ) = ( + 1)n ( + 1 under the MM model. 3 Conclusion In this study, we show that the -extra conditional dianosability t (F Q n ) of the folded hypercube F Q n is ( + 1)n ( + 1 under the PMC model and the MM model in some cases. ( + 1)n ( + 1 is several times larer than the conditional dianosability of the folded hypercube iven by Zhu et al. [13] under the PMC model and the conditional dianosability of the folded hypercube iven by Hsieh et al. [4] under the MM model. References [1] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, The Macmillan Press Ltd, New York, [2] A.T. Dahbura, G.M. Masson, An O(n 2.5 ) fault identification alorithm for dianosable systems, IEEE Transactions on Computers, C-33 (1984),
8 7254 Weipin Han and Shiyin Wan [3] A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems, 2 (1991), [4] S.Y. Hsieh, C.Y. Tsai, C.A. Chen, Stron dianosability and conditional dianosability of multiprocessor systems and folded hypercubes, IEEE Transactions on Computers, 62 (2013), [5] S. Latifi, M. Hede, M. Narahi-Pour, Conditional connectivity measures for lare multiprocessor systems, IEEE Transactions on Computers, 43 (1994), no. 2, [6] J. Maen, M. Malek, A comparison connection assinment for selfdianosis of multiprocessor systems, Proceedin of 11th International Symposium on Fault-Tolerant Computin, 11 (1981), [7] F.P. Preparata, G. Metze, R.T. Chien, On the connection assinment problem of dianosable systems, IEEE Transactions on Electronic Computers, EC-16 (1967), no. 6, [8] Y. Saad, M.H. Schultz, Topoloical properties of hypercubes, IEEE Transactions on Computers, 37 (1988), no. 7, [9] A. Senupta, A.T. Dahbura, On self-dianosable multiprocessor systems: dianosis by the comparison approach, IEEE Transactions on Computers, 41 (199, no. 11, [10] W.H. Yan, J.X. Men, Extraconnectivity of folded hypercubes, Ars Combinatoria, 116 (2014), [11] S.R. Zhan, W.H. Yan, The -extra conditional dianosability and sequential t/k-dianosability of hypercubes, International Journal of Computer Mathematics, (2015). [12] Q. Zhu, J.M. Xu, X.M. Hou, M. Xu, On reliability of the folded hypercubes, Information Sciences, 177 (2007), [13] Q. Zhu, S.Y. Liu, M. Xu, On conditional dianosability of the folded hypercubes, Information Sciences, 178 (2008), Received: November 12, 2015; Published: December 15, 2015
Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model
Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model Qiang Zhu,Lili Li, Sanyang Liu, Xing Zhang arxiv:1709.05588v1 [cs.dc] 17 Sep 017 Abstract System level diagnosis
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationAlgebraic Properties and Panconnectivity of Folded Hypercubes
Algebraic Properties and Panconnectivity of Folded Hypercubes Meijie Ma a Jun-Ming Xu b a School of Mathematics and System Science, Shandong University Jinan, 50100, China b Department of Mathematics,
More informationSecure Weakly Connected Domination in the Join of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 14, 697-702 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.519 Secure Weakly Connected Domination in the Join of Graphs
More informationSecure Weakly Convex Domination in Graphs
Applied Mathematical Sciences, Vol 9, 2015, no 3, 143-147 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams2015411992 Secure Weakly Convex Domination in Graphs Rene E Leonida Mathematics Department
More informationON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES
Discussiones Mathematicae Graph Theory 36 (2016) 805 817 doi:10.7151/dmgt.1908 ON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES Jianxiang Cao, Minyong Shi School of Computer Science Communication
More informationRestrained Independent 2-Domination in the Join and Corona of Graphs
Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3171-3176 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.711343 Restrained Independent 2-Domination in the Join and Corona of Graphs
More informationOn Annihilator Small Intersection Graph
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 283-289 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7931 On Annihilator Small Intersection Graph Mehdi
More informationDouble Total Domination on Generalized Petersen Graphs 1
Applied Mathematical Sciences, Vol. 11, 2017, no. 19, 905-912 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.7114 Double Total Domination on Generalized Petersen Graphs 1 Chengye Zhao 2
More informationDouble Total Domination in Circulant Graphs 1
Applied Mathematical Sciences, Vol. 12, 2018, no. 32, 1623-1633 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.811172 Double Total Domination in Circulant Graphs 1 Qin Zhang and Chengye
More informationThe super connectivity of shuffle-cubes
Information Processing Letters 96 (2005) 123 127 www.elsevier.com/locate/ipl The super connectivity of shuffle-cubes Jun-Ming Xu a,,minxu b, Qiang Zhu c a Department of Mathematics, University of Science
More informationarxiv: v1 [math.co] 27 Apr 2016
arxiv:1604.07895v1 [math.co] 27 Apr 2016 Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges Mei-Mei Gu Department of Mathematics, Beijing Jiaotong University, Beijing 100044,
More informationNo.5 Node Grouping in System-Level Fault Diagnosis 475 identified under above strategy is precise in the sense that all nodes in F are truly faulty an
Vol.16 No.5 J. Comput. Sci. & Technol. Sept. 2001 Node Grouping in System-Level Fault Diagnosis ZHANG Dafang (± ) 1, XIE Gaogang (ΞΛ ) 1 and MIN Yinghua ( ΠΦ) 2 1 Department of Computer Science, Hunan
More informationTheoretical Computer Science. Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science 410 (2009) 766 775 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Fault-free longest paths in star networks
More informationA Generalization of p-rings
International Journal of Algebra, Vol. 9, 2015, no. 8, 395-401 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2015.5848 A Generalization of p-rings Adil Yaqub Department of Mathematics University
More informationOn Regular Prime Graphs of Solvable Groups
International Journal of Algebra, Vol. 10, 2016, no. 10, 491-495 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2016.6858 On Regular Prime Graphs of Solvable Groups Donnie Munyao Kasyoki Department
More informationRestrained Weakly Connected Independent Domination in the Corona and Composition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 20, 973-978 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121046 Restrained Weakly Connected Independent Domination in the Corona and
More informationOn Symmetric Bi-Multipliers of Lattice Implication Algebras
International Mathematical Forum, Vol. 13, 2018, no. 7, 343-350 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2018.8423 On Symmetric Bi-Multipliers of Lattice Implication Algebras Kyung Ho
More informationOn the Probability that a Group Element Fixes a Set and its Generalized Conjugacy Class Graph
International Journal of Mathematical Analysis Vol. 9, 2015, no. 4, 161-167 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.411336 On the Probability that a roup Element Fixes a Set and
More informationOn the Laplacian Energy of Windmill Graph. and Graph D m,cn
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 9, 405-414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.6844 On the Laplacian Energy of Windmill Graph
More informationLocating Chromatic Number of Banana Tree
International Mathematical Forum, Vol. 12, 2017, no. 1, 39-45 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.610138 Locating Chromatic Number of Banana Tree Asmiati Department of Mathematics
More informationPoincaré`s Map in a Van der Pol Equation
International Journal of Mathematical Analysis Vol. 8, 014, no. 59, 939-943 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.014.411338 Poincaré`s Map in a Van der Pol Equation Eduardo-Luis
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationInduced Cycle Decomposition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 84, 4165-4169 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.5269 Induced Cycle Decomposition of Graphs Rosalio G. Artes, Jr. Department
More informationAnother Look at p-liar s Domination in Graphs
International Journal of Mathematical Analysis Vol 10, 2016, no 5, 213-221 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma2016511283 Another Look at p-liar s Domination in Graphs Carlito B Balandra
More informationOn Almost Simple Transcendental Field Extensions
International Journal of Alebra, Vol. 9, 2015, no. 2, 53-58 HIKARI Ltd, www.m-hikari.com http://dx.doi.or/10.12988/ija.2015.412123 On Almost Simple Transcendental Field Extensions Antonio González Fernández,
More informationLocating-Dominating Sets in Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 88, 4381-4388 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46400 Locating-Dominating Sets in Graphs Sergio R. Canoy, Jr. 1, Gina A.
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationEdge Fixed Steiner Number of a Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 16, 771-785 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7694 Edge Fixed Steiner Number of a Graph M. Perumalsamy 1,
More informationJoin Reductions and Join Saturation Reductions of Abstract Knowledge Bases 1
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 3, 109-115 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7312 Join Reductions and Join Saturation Reductions
More informationEdge-pancyclicity of Möbius cubes
Information Processing Letters 96 (25) 136 14 www.elsevier.com/locate/ipl Edge-pancyclicity of Möbius cubes Min Xu a,b, Jun-Ming Xu b, a Institute of Applied Mathematics, Academy of Mathematics and Systems
More informationRainbow Connection Number of the Thorn Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6373-6377 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48633 Rainbow Connection Number of the Thorn Graph Yixiao Liu Department
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 informationNote on the Expected Value of a Function of a Fuzzy Variable
International Journal of Mathematical Analysis Vol. 9, 15, no. 55, 71-76 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.1988/ijma.15.5145 Note on the Expected Value of a Function of a Fuzzy Variable
More informationARTICLE IN PRESS Discrete Applied Mathematics ( )
Discrete Applied Mathematics ( ) Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Forwarding index of cube-connected cycles Jun Yan a,
More informationThe Rainbow Connection of Windmill and Corona Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6367-6372 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48632 The Rainbow Connection of Windmill and Corona Graph Yixiao Liu Department
More informationThe multiplicative Zagreb indices of graph operations
Das et al Journal of Inequalities and Applications 0, 0:90 R E S E A R C H Open Access The multiplicative Zagreb indices of graph operations Kinkar C Das, Aysun Yurttas,MugeTogan, Ahmet Sinan Cevik and
More informationKKM-Type Theorems for Best Proximal Points in Normed Linear Space
International Journal of Mathematical Analysis Vol. 12, 2018, no. 12, 603-609 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2018.81069 KKM-Type Theorems for Best Proximal Points in Normed
More informationAutomorphism group of the balanced hypercube
Abstract Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 12 (2017) 145 154 Automorphism group of the balanced hypercube
More informationBounds Improvement for Neuman-Sándor Mean Using Arithmetic, Quadratic and Contraharmonic Means 1
International Mathematical Forum, Vol. 8, 2013, no. 30, 1477-1485 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.36125 Bounds Improvement for Neuman-Sándor Mean Using Arithmetic, Quadratic
More informationGeneralized Boolean and Boolean-Like Rings
International Journal of Algebra, Vol. 7, 2013, no. 9, 429-438 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.2894 Generalized Boolean and Boolean-Like Rings Hazar Abu Khuzam Department
More informationA Class of Z4C-Groups
Applied Mathematical Sciences, Vol. 9, 2015, no. 41, 2031-2035 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121008 A Class of Z4C-Groups Jinshan Zhang 1 School of Science Sichuan University
More informationDiophantine Equations. Elementary Methods
International Mathematical Forum, Vol. 12, 2017, no. 9, 429-438 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7223 Diophantine Equations. Elementary Methods Rafael Jakimczuk División Matemática,
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 informationInternational Mathematical Forum, Vol. 9, 2014, no. 36, HIKARI Ltd,
International Mathematical Forum, Vol. 9, 2014, no. 36, 1751-1756 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.411187 Generalized Filters S. Palaniammal Department of Mathematics Thiruvalluvar
More informationβ Baire Spaces and β Baire Property
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 5, 211-216 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.612 β Baire Spaces and β Baire Property Tugba
More informationOn a 3-Uniform Path-Hypergraph on 5 Vertices
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1489-1500 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.512742 On a 3-Uniform Path-Hypergraph on 5 Vertices Paola Bonacini Department
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 informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationSolving Homogeneous Systems with Sub-matrices
Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State
More informationNote on Strong Roman Domination in Graphs
Applied Mathematical Sciences, Vol. 12, 2018, no. 11, 55-541 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.851 Note on Strong Roman Domination in Graphs Jiaxue Xu and Zhiping Wang Department
More informationPositive Solution of a Nonlinear Four-Point Boundary-Value Problem
Nonlinear Analysis and Differential Equations, Vol. 5, 27, no. 8, 299-38 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/nade.27.78 Positive Solution of a Nonlinear Four-Point Boundary-Value Problem
More informationA Note of the Strong Convergence of the Mann Iteration for Demicontractive Mappings
Applied Mathematical Sciences, Vol. 10, 2016, no. 6, 255-261 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.511700 A Note of the Strong Convergence of the Mann Iteration for Demicontractive
More informationGroup Inverse for a Class of. Centrosymmetric Matrix
International athematical Forum, Vol. 13, 018, no. 8, 351-356 HIKARI Ltd, www.m-hikari.com https://doi.org/10.1988/imf.018.8530 Group Inverse for a Class of Centrosymmetric atrix ei Wang and Junqing Wang
More informationA Direct Proof of Caristi s Fixed Point Theorem
Applied Mathematical Sciences, Vol. 10, 2016, no. 46, 2289-2294 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.66190 A Direct Proof of Caristi s Fixed Point Theorem Wei-Shih Du Department
More informationIndependent Transversal Equitable Domination in Graphs
International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationMore on Tree Cover of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 12, 575-579 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.410320 More on Tree Cover of Graphs Rosalio G. Artes, Jr.
More informationµs p -Sets and µs p -Functions
International Journal of Mathematical Analysis Vol. 9, 2015, no. 11, 499-508 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.412401 µs p -Sets and µs p -Functions Philip Lester Pillo
More informationDiameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring
International Mathematical Forum, Vol. 9, 2014, no. 29, 1369-1375 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47131 Diameter of the Zero Divisor Graph of Semiring of Matrices over
More informationACG M and ACG H Functions
International Journal of Mathematical Analysis Vol. 8, 2014, no. 51, 2539-2545 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/10.12988/ijma.2014.410302 ACG M and ACG H Functions Julius V. Benitez Department
More informationNonexistence of Limit Cycles in Rayleigh System
International Journal of Mathematical Analysis Vol. 8, 014, no. 49, 47-431 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.014.4883 Nonexistence of Limit Cycles in Rayleigh System Sandro-Jose
More informationRoot Square Mean Labeling of Some More. Disconnected Graphs
International Mathematical Forum, Vol. 10, 2015, no. 1, 25-34 HIKARI Ltd,www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.411196 Root Square Mean Labeling of Some More Disconnected Graphs S. S. Sandhya
More informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
More informationSharp Bounds for Seiffert Mean in Terms of Arithmetic and Geometric Means 1
Int. Journal of Math. Analysis, Vol. 7, 01, no. 6, 1765-177 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.01.49 Sharp Bounds for Seiffert Mean in Terms of Arithmetic and Geometric Means 1
More informationEmbed Longest Rings onto Star Graphs with Vertex Faults
Embed Longest Rings onto Star Graphs with Vertex Faults Sun-Yuan Hsieh, Gen-Huey Chen Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, ROC and Chin-Wen
More informationA Queueing Model for Sleep as a Vacation
Applied Mathematical Sciences, Vol. 2, 208, no. 25, 239-249 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ams.208.8823 A Queueing Model for Sleep as a Vacation Nian Liu School of Mathematics and
More informationBipanconnectivity of Cartesian product networks
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 297 306 Bipanconnectivity of Cartesian product networks You Lu Jun-Ming Xu Department of Mathematics University of Science and Technology of
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationOrder-theoretical Characterizations of Countably Approximating Posets 1
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 9, 447-454 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.4658 Order-theoretical Characterizations of Countably Approximating Posets
More informationOn Some Distance-Based Indices of Trees With a Given Matching Number
Applied Mathematical Sciences, Vol. 8, 204, no. 22, 6093-602 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.2988/ams.204.48656 On Some Distance-Based Indices of Trees With a Gien Matching Number Shu
More informationHyper-Panconnectedness of the Locally Twisted Cube
Hyper-Panconnectedness of the Locally Twisted Cube Tzu-Liang Kung Department of Computer Science and Information Engineering Asia University, Wufeng, Taichung tlkung@asia.edu.tw Lih-Hsing Hsu and Jia-Jhe
More informationQuadratic Optimization over a Polyhedral Set
International Mathematical Forum, Vol. 9, 2014, no. 13, 621-629 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.4234 Quadratic Optimization over a Polyhedral Set T. Bayartugs, Ch. Battuvshin
More informationA Generalization of Generalized Triangular Fuzzy Sets
International Journal of Mathematical Analysis Vol, 207, no 9, 433-443 HIKARI Ltd, wwwm-hikaricom https://doiorg/02988/ijma2077350 A Generalization of Generalized Triangular Fuzzy Sets Chang Il Kim Department
More informationBlock-Transitive 4 (v, k, 4) Designs and Suzuki Groups
International Journal of Algebra, Vol. 10, 2016, no. 1, 27-32 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.51277 Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups Shaojun Dai Department
More informationOn Two New Classes of Fibonacci and Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
Applied Mathematical Sciences Vol. 207 no. 25 2-29 HIKARI Ltd www.m-hikari.com https://doi.org/0.2988/ams.207.7392 On Two New Classes of Fibonacci Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
More informationStrong Convergence of the Mann Iteration for Demicontractive Mappings
Applied Mathematical Sciences, Vol. 9, 015, no. 4, 061-068 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.015.5166 Strong Convergence of the Mann Iteration for Demicontractive Mappings Ştefan
More informationDirect Product of BF-Algebras
International Journal of Algebra, Vol. 10, 2016, no. 3, 125-132 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.614 Direct Product of BF-Algebras Randy C. Teves and Joemar C. Endam Department
More informationFunctional Form of the Jensen and the Hermite-Hadamard Inequality
Applied Mathematical Sciences, Vol. 9, 2015, no. 4, 149-159 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.411888 Functional Form of the Jensen and the Hermite-Hadamard Inequality Zlatko
More informationMoore-Penrose Inverses of Operators in Hilbert C -Modules
International Journal of Mathematical Analysis Vol. 11, 2017, no. 8, 389-396 HIKARI Ltd, www.m-hikari.com https//doi.org/10.12988/ijma.2017.7342 Moore-Penrose Inverses of Operators in Hilbert C -Modules
More informationLeft R-prime (R, S)-submodules
International Mathematical Forum, Vol. 8, 2013, no. 13, 619-626 HIKARI Ltd, www.m-hikari.com Left R-prime (R, S)-submodules T. Khumprapussorn Department of Mathematics, Faculty of Science King Mongkut
More informationWeak Resolvable Spaces and. Decomposition of Continuity
Pure Mathematical Sciences, Vol. 6, 2017, no. 1, 19-28 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/pms.2017.61020 Weak Resolvable Spaces and Decomposition of Continuity Mustafa H. Hadi University
More informationPancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network
Pancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network Jung-Sheng Fu Takming College, Taipei, TAIWAN jsfu@mail.takming.edu.tw Gen-Huey Chen Department of Computer Science and Information
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 informationHyperbolic Functions and. the Heat Balance Integral Method
Nonl. Analysis and Differential Equations, Vol. 1, 2013, no. 1, 23-27 HIKARI Ltd, www.m-hikari.com Hyperbolic Functions and the Heat Balance Integral Method G. Nhawu and G. Tapedzesa Department of Mathematics,
More informationOn the Upper Chromatic Number of Uniform Hypergraphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 101, 5015-5025 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.4586 On the Upper Chromatic Number of Uniform Hypergraphs Mario Gionfriddo
More informationDecompositions of Balanced Complete Bipartite Graphs into Suns and Stars
International Journal of Contemporary Mathematical Sciences Vol. 13, 2018, no. 3, 141-148 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2018.8515 Decompositions of Balanced Complete Bipartite
More informationOn a Certain Representation in the Pairs of Normed Spaces
Applied Mathematical Sciences, Vol. 12, 2018, no. 3, 115-119 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.712362 On a Certain Representation in the Pairs of ormed Spaces Ahiro Hoshida
More informationNew Generalized Sub Class of Cyclic-Goppa Code
International Journal of Contemporary Mathematical Sciences Vol., 206, no. 7, 333-34 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.2988/ijcms.206.6632 New Generalized Sub Class of Cyclic-Goppa Code
More informationAn Abundancy Result for the Two Prime Power Case and Results for an Equations of Goormaghtigh
International Mathematical Forum, Vol. 8, 2013, no. 9, 427-432 HIKARI Ltd, www.m-hikari.com An Abundancy Result for the Two Prime Power Case and Results for an Equations of Goormaghtigh Richard F. Ryan
More informationSome Reviews on Ranks of Upper Triangular Block Matrices over a Skew Field
International Mathematical Forum, Vol 13, 2018, no 7, 323-335 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20188528 Some Reviews on Ranks of Upper Triangular lock Matrices over a Skew Field Netsai
More informationof a Two-Operator Product 1
Applied Mathematical Sciences, Vol. 7, 2013, no. 130, 6465-6474 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.39501 Reverse Order Law for {1, 3}-Inverse of a Two-Operator Product 1 XUE
More informationInner Variation and the SLi-Functions
International Journal of Mathematical Analysis Vol. 9, 2015, no. 3, 141-150 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.411343 Inner Variation and the SLi-Functions Julius V. Benitez
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationApproximations to the t Distribution
Applied Mathematical Sciences, Vol. 9, 2015, no. 49, 2445-2449 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.52148 Approximations to the t Distribution Bashar Zogheib 1 and Ali Elsaheli
More informationp-liar s Domination in a Graph
Applied Mathematical Sciences, Vol 9, 015, no 107, 5331-5341 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ams0155749 p-liar s Domination in a Graph Carlito B Balandra 1 Department of Arts and Sciences
More informationk-jacobsthal and k-jacobsthal Lucas Matrix Sequences
International Mathematical Forum, Vol 11, 016, no 3, 145-154 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/imf0165119 k-jacobsthal and k-jacobsthal Lucas Matrix Sequences S Uygun 1 and H Eldogan Department
More informationThe Linear Chain as an Extremal Value of VDB Topological Indices of Polyomino Chains
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5133-5143 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46507 The Linear Chain as an Extremal Value of VDB Topological Indices of
More information