ON THE INJECTIVE DOMINATION OF GRAPHS
|
|
- Noah Dawson
- 5 years ago
- Views:
Transcription
1 Palestine Journal of Mathematics Vol. 7(1)(018), 0 10 Palestine Polytechnic Uniersity-PPU 018 ON THE INJECTIVE DOMINATION OF GRAPHS Anwar Alwardi, R. Rangarajan and Akram Alqesmah Communicated by Ayman Badawi MSC 010 Classications: 0C9. Keywords and hrases: Injectie domination number, Injectie indeendence number, Injectie domatic number. Abstract. Let G = (V, E) be a simle grah. A subset D of V is called injectie dominating set (Inj-dominating set) if for eery ertex V D there exists a ertex u D such that G(u, ) 1, where G(u, ) is the number of common neighbors between the ertices u and. The minimum cardinality of such dominating set denoted by γ in (G) and is called injectie domination number (Inj-domination number) of G. In this aer, we introduce the injectie domination of a grah G and analogous to that, we dene the injectie indeendence number (Inj-indeendence number) β in (G) and injectie domatic number (Inj-domatic number) d in (G). Bounds and some interesting results are established. 1 Introduction By a grah we mean a nite, undirected with no loos and multile edges. In general, we use X to denote the subgrah induced by the set of ertices X and N(), N[] denote the oen and closed neighborhood of a ertex, resectiely. The distance between two ertices u and in G is the number of edges in a shortest ath connecting them, this is also known as the geodesic distance. The eccentricity of a ertex is the greatest geodesic distance between and any other ertex and denoted by e(). A set D of ertices in a grah G is a dominating set if eery ertex in V D is adjacent to some ertex in D. The domination number γ(g) is the minimum cardinality of a dominating set of G. We denote to the smallest integer greater than or equal to x by x and the greatest integer less than or equal to x by x. A strongly regular grah with arameters (n, k, λ, µ) is a grah with n ertices such that the number of common neighbors of two ertices u and is k, λ or µ according to whether u and are equal, adjacent or non-adjacent, resectiely. When λ = 0 the strongly regular grah is called strongly regular grah with no triangles (SRNT grah). A strongly regular grah G is called rimitie if G and G are connected. For terminology and notations not secically dened here we refer the reader to []. For more details about domination number and neighborhood number and their related arameters, we refer to [3], [4]. The common neighborhood domination in grah has introduced in []. A subset D of V is called common neighborhood dominating set (CN-dominating set) if for eery ertex V D there exists a ertex u D such that u E(G) and G(u, ) 1, where G(u, ) is the number of common neighborhood between the ertices u and. The minimum cardinality of such dominating set denoted by γ cn (G) and is called common neighborhood domination number (CN-domination number) of G. The common neighborhood (CN-neighborhood) of a ertex u V (G) denoted by N cn (u) is dened as N cn (u) = { V (G) : u E(G) and G(u, ) 1}. The common neighborhood grah (congrah) of G, denoted by con(g), is the grah with the ertex set 1,,...,, in which two ertices are adjacent if and only if they hae at least one common neighbor in the grah G [1]. In this aer, we introduce the concet of injectie domination in grahs. In ordinary domination between ertices is enough for a ertex to dominate another in ractice. If the ersons
2 ON THE INJECTIVE DOMINATION OF GRAPHS 03 hae common friend then it may result in friendshi. Human beings hae a tendency to moe with others when they hae common friends. Injectie Dominating Sets In defence and domination roblem in some situations there should not be direct contact between two indiiduals but can be linked by a third erson this motiated us to introduced the concet of injectie domination. Denition.1 ([1]). Let G be simle grah with ertex set V (G) = { 1,,..., }. For i j, the common neighborhood of the ertices i and j, denoted by G( i, j ), is the set of ertices, different from i and j, which are adjacent to both i and j. Denition.. Let G = (V, E) be a grah. A subset D of V is called injectie dominating set (Inj-dominating set) if for eery ertex V either D or there exists a ertex u D such that G(u, ) 1. The minimum cardinality of Inj-dominating set of G denoted by γ in (G) and called injectie domination number (Inj-domination number) of G. For examle consider a grah G in Figure 1. Then {, 7} is a minimum dominating set, {, 3, 4,, } is a minimum CN-dominating set and {1} is a minimum injectie dominating set of G. Thus γ(g) =, γ cn (G) = and γ in (G) = Figure 1. Grah with γ in (G) = 1 Obiously, for any grah G, the ertex set V (G) is an Inj-dominating set, that means any grah G has an Inj-dominating set and hence Inj-domination number. An injectie dominating set D is said to be a minimal Inj-dominating set if no roer subset of D is an Inj-dominating set. Clearly each minimum Inj-dominating set is minimal but the conerse is not true in general, for examle let G be a grah as in Figure 1. Then {, 3} is a minimal Inj-dominating set but not minimum Inj-dominating set. Let u V. The Inj-neighborhood of u denoted by N in (u) is dened as N in (u) = { V (G) : G(u, ) 1}. The cardinality of N in (u) is called the injectie degree of the ertex u and denoted by deg in (u) in G, and N in [u] = N in (u) {u}. The maximum and minimum injectie degree of a ertex in G are denoted resectiely by Din(G) and δ in (G). That is Din(G) = max u V N in (u), δ in (G) = min u V N in (u). The injectie comlement of G denoted by G inj is the grah with same ertex set V (G) and any two ertices u and in G inj are adjacent if and only if they are not Inj-adjacent in G. A subset S of V is called an injectie indeendent set (Inj-indeendent set), if for eery u S, / N in (u) for all S {u}. An injectie indeendent set S is called maximal if any ertex set roerly containing S is not Injindeendent set, the maximum cardinality of Inj-indeendent set is denoted by β in, and the lower Inj-indeendence number i in is the minimum cardinality of the Inj-maximal indeendent set. As usual P, C, K and W are the -ertex ath, cycle, comlete, and wheel grah resectiely, K r,m is the comlete biartite grah on r + m ertices and S is the star with ertices.
3 04 Anwar Alwardi, R. Rangarajan and Akram Alqesmah Proosition.3. Let G = (V, E) be a grah and u V be such that G(u, ) = 0 for all V (G). Then u is in eery injectie dominating set, such ertices are called injectie isolated ertices. Proosition.4. Let G = (V, E) be strongly regular grah with arameters (n, k, λ, µ). Then γ in (G) = 1 or. Proosition.. For any grah G, γ in (G) γ cn (G) Proof. From the denition of the CN-dominating set of a grah G. For any grah G any CNdominating set D is also Inj-dominating set. Hence γ in (G) γ cn (G). We note that the Inj-domination number of a grah G may be greater than, smaller than or equal to the domination number of G. Examle.. (i) γ in (P ) = ; γ(p ) = 1. (ii) γ in (C ) = ; γ(c ) =. (iii) If G is the Petersen grah, then γ in (G) = ; γ(g) = 3. Proosition.7. (i) For any comlete grah K, where, γ in (K ) = 1. (ii) For any wheel grah G = W, γ in (G) = 1. (iii) For any comlete biartite grah K r,m, γ in (K r,m ) =. (i) For any grah G, γ in (K + G) = 1, where. Proosition.8. For any grah G with ertices, 1 γ in (G). Proosition.9. Let G be grah with ertices. Then γ in (G) = if and only if G is a forest with D(G) 1. Proof. Let G be a forest with D(G) 1. Then we hae two cases. Case 1. If G is connected, then either G = K or G = K 1. Hence, γ in (G) =. Case. If G is disconnected, then G = n 1 K n K 1, thus γ in (G) =. Conersely, if γ in (G) =, then all the ertices of G are Inj-isolated, that means G is isomorhic to K 1 or K or to the disjoint union of K 1 and K, that is G = n 1 K n K 1 for some n 1,n {0, 1,,...}. Hence, G is a forest with D(G) 1. Proosition.10. Let G be a nontriial connected grah. Then γ in (G) = 1 if and only if there exists a ertex V (G) such that N() = N cn () and e(). Proof. Let V (G) be any ertex in G such that N() = N cn () and e(). Then for any ertex u V (G) {} if u is adjacent to, since N() = N cn (), then obious u N in (). If u is not adjacent to, then G(u, ) 1. Thus for any ertex u V (G) {}, G(u, ) 1. Hence, γ in (G) = 1. Conersely, if G is a grah with ertices and γ in (G) = 1, then there exist at least one ertex V (G) such that deg in () = 1, then any ertex u V (G) {} either contained in a triangle with or has distance two from. Hence, N() = N cn () and e(). Theorem.11 ([]). For any ath P and any cycle C, where 3, we hae, γ(p ) = γ(c ) =. 3 Proosition.1 ([]). For any ath P and any cycle C (i) con(p ) = P P.
4 (ii) con(c ) = ON THE INJECTIVE DOMINATION OF GRAPHS 0 C, if is odd and 3; P P, if = 4; C C, if is een. From the denition of the common neighborhood grah and the Inj-domination in a grah the following roosition can easily eried. Proosition.13. For any grah G, γ in (G) = γ(con(g)). The roof of the following roosition is straightforward from Theorem.11 and Proosition.1. Proosition.14. For any cycle C with odd number of ertices 3, γ in (C ) = γ(c ) = 3 Theorem.1. For any cycle C with een number of ertices 3, γ in (C ) =. Proof. From Proosition.13, Theorem.11 and Proosition.1, if is een, then γ in (C ) = γ((c ) (C )) = γ(c ) =. Proosition.1. For any odd number > 3, + 1 γ in (P ) = + 1 Proof. From Proosition.13, Theorem.11 and Proosition.1, if is odd then, γ in (P ) = γ(p P ) = γ(p +1 P 1 ) = +.. Proosition.17. For any een number 4, γ in (P ) =. Proof. From Proosition.13, Theorem.11 and Proosition.1, if is een then, = =. Hence γ in(p ) =. Theorem.18. Let G = (V, E) be a grah without Inj-isolated ertices. Inj-dominating set, then V D is an Inj-dominating set. If D is a minimal Proof. Let D be a minimal Inj-dominating set of G. Suose V D is not Inj-dominating set. Then there exists a ertex u in D such that u is not Inj-dominated by any ertex in V D, that is G(u, ) = 0 for any ertex in V D. Since G has no Inj-isolated ertices, then there is at least one ertex in D {u} has common neighborhood with u. Thus D {u} is Inj-dominating set of G, which contradicts the minimality of the Inj dominating set D. Thus eery ertex in D has common neighborhood with at least one ertex in V D. Hence V D is an Inj-dominating set. Theorem.19. Let G be a grah. Then the injectie dominating set D is minimal if and only if for eery ertex D, one of the following conditions holds (i) is Inj-isolated ertex. (ii) There exists a ertex u in V D such that N in (u) D = {}.
5 0 Anwar Alwardi, R. Rangarajan and Akram Alqesmah Proof. Suose D is a minimal Inj-dominating set of G. Then D {} is not Inj-dominating set, then there exists at least one ertex u (V D) {} is not Inj-dominated by any ertex in D, so we hae two cases. Case 1. If u D, then u is Inj-isolated ertex. Case. If u V D, then u has common neighborhood with only one ertex in D, that means N in (u) D = {}. Conersely, suose D is an Inj-dominating set of G and for each ertex D one of the two conditions holds, we want to roe that D is a minimal Inj-dominating set. Suose that D is not minimal. Then there is at least one ertex D such that D {} is an Inj-dominating set. Thus has common neighborhood with at least one ertex in D {}. Hence, condition (i) is not hold. Also, V D is an Inj-dominating set, then eery ertex in V D has common neighborhood with at least one ertex in D {}. Therefore condition (ii) is not hold. Hence, neither condition (i) nor condition (ii) holds, which is a contradiction. Theorem.0. A grah G has a unique minimal Inj-dominating set if and only if the set of all Inj-isolated ertices forms an Inj-dominating set. Proof. Let G has a unique minimal Inj-dominating set D, and suose S = {u V : u is Inj-isolated ertex}. Then S D. Now suose D S, let D S, since is not Injisolated ertex, then V {} is an Inj-dominating set. Hence there is a minimal Inj-dominating set D 1 V {} and D 1 D a contradiction to the fact that G has a unique minimal Injdominating set. Therefore S = D. Conersely, if the set of all Inj-isolated ertices in G forms an Inj-dominating set, then it is clear that G has a unique minimal Inj-dominating set. Theorem.1. For any (, q)-grah G, γ in (G) q. Proof. Let D be a minimum Inj-dominating set of G. Since eery ertex in V D has common neighborhood with at least one ertex of D, then q V D. Hence, γ in (G) q. Theorem.. For any grah G with ertices, 1+D in (G) γ in(g). Further, the equality holds if and only if for eery minimum Inj-dominating set D in G the following conditions are satised: (i) for any ertex in D, deg in () = Din(G); (ii) D is Inj-indeendent set in G; (iii) eery ertex in V D has common neighborhood with exactly one ertex in D. Proof. Let S be any minimum Inj-dominating set in G. Clearly each ertex in G will Injdominate at most (Din(G) + 1) ertices, so = N in [S] γ in (G)(Din(G) + 1), hence 1+D in (G) γ in(g). Therefore 1+D in (G) γ in(g). Suose the gien conditions are hold for any minimum Inj-dominating set D in G. Then obiously γ in (G)Din(G) + γ in (G) =. Hence, 1+D = γ in(g) in(g). Conersely, suose the equality holds, and suose that one from the conditions is not satised. Then < γ in (G)Din(G) + γ in (G), a contradiction. Examle.3. Let G = C, where 3 and is odd number. Then the equality in Theorem. is hold. Since 1+D = and by Proosition.14 we hae γ in(g) 3 in(g) =. 3 Theorem.4. Let G be a grah on ertices and δ in (G) 1. Then γ in (G). Proof. Let D be any minimal Inj-dominating set in G. Then by Theorem.18, V D is also an Inj-dominating set in G. Hence, γ in (G) min{ D, V D } /. Theorem.. For any grah G on ertices, γ in (G) Din(G) Proof. Let be a ertex in G such that deg in () = Din(G). Then has common neighborhood with N in () = Din(G) ertices. Thus, V N in () is an Inj-dominating set. Therefore γ in (G) V N in (). Hence, γ in (G) Din(G).
6 ON THE INJECTIVE DOMINATION OF GRAPHS 07 Proosition.. For any grah G with diameter less than or equal three and maximum degree D(G), γ in (G) D(G) + 1. Proof. Let diam(g) 3 and V (G) such that deg() = D(G). Clearly that, if diam(g) = 1, then G is a comlete grah and the result holds. Suose diam(g) = or 3. Let V i (G) V (G) be the sets of ertices of G which hae distance i from, where i = 1,, 3. Obiously, the set S = V 1 (G) {} is an Inj-dominating set of G of order D(G)+1. Hence, γ in (G) D(G)+1. The Cartesian roduct G H of two grahs G and H is a grah with ertex set V (G) V (H) and edge set E(G H) = {((u, u ), (, )) : u = and (u, ) E(H), or u = and (u, ) E(G)} m u 1 u u 3 u 4 u m Figure. P m P Proosition.7. For any grah G = P m P, γ in (G) = m. Proof. Let G = P m P. From Figure, it is easy to see that any two adjacent ertices i, u i can Inj-dominate all the ertices of distance less than or equal two from i or u i, then γ in (G) m. obiously from Figure, D in(g) = 4, then by Theorem., γ in (G) m. Now, if m < or m 0 (mod ), then m = m and hence γ in(g) = m. Otherwise, m = m + 1, but in this case the equality of Theorem. does not hold because the third condition is not satised. Hence, γ in (G) = m. Proosition.8. For any grah G = C m P, γ in (G) = m. Proof. The roof is same as in Proosition.7. The Comosition G H or G[H] has its ertex set V (G) V (H), with (u, u ) is adjacent to (, ) if either u is adjacent to in G or u = and u is adjacent to in H. Proosition.9. For any grah G isomorhic to P m P n or P m C n or C m P n or C m C n, γ in (G) = m. Proof. Let G be a grah isomorhic to P m P n or P m C n or C m P n or C m C n. Then from the denition of the Comosition roduct, N(w) = N cn (w), w V (G), then each ertex w = (u, ) in G Inj-dominates its neighbors and all the ertices of distance two of it, then γ in (G) m, but in this grah D in(g) = n 1, so by Theorem., γ in (G) mn n = m. Hence, γ in (G) = m. Denition.30. Let G = (V, E) be a grah. S V (G) is called Inj-indeendent set if no two ertices in S hae common neighbor. An Inj-indeendent set S is called maximal Injindeendent set if no suerset of S is Inj-indeendent set. The Inj-indeendent set with maximum size called the maximum Inj-indeendent set in G and its size called the Inj-indeendence number of G and denoted by β in (G). Theorem.31. Let S be a maximal Inj-indeendent set. Then S is a minimal Inj-dominating set.
7 08 Anwar Alwardi, R. Rangarajan and Akram Alqesmah Proof. Let S be a maximal Inj-indeendent set and u V S. If u / N in () for eery S, then S {u} is an Inj-indeendent set, a contradiction to the maximality of S. Therefore u N in () for some S. Hence, S is an Inj-dominating set. To roe that S is a minimal Inj-dominating set, suose S is not minimal. Then for some u S the set S {u} is an Inj-dominating set. Then there exist some ertex in S has a common neighborhood with u, a contradiction because S is an Inj-indeendent set. Therefore S is a minimal Inj-dominating set. Corollary.3. For any grah G, γ in (G) β in (G). 3 Injectie domatic number in a grah Let G = (V, E) be a grah. A artition D of its ertex set V (G) is called a domatic artition of G if each class of D is a dominating set in G. The maximum order of a artition of V (G) into dominating sets is called the domatic number of G and is denoted by d(g). Analogously as to γ(g) the domatic number d(g) was introduced, we introduce the injectie domatic number d in (G), and we obtain some bounds and establish some roerties of the injectie domatic number of a grah G. Denition 3.1. Let G = (V, E) be a grah. A artition D of its ertex set V (G) is called an injectie domatic (in short Inj-domatic) artition of G if each class of D is an Inj-dominating set in G. The maximum order of a artition of V (G) into Inj-dominating sets is called the Injdomatic number of G and is denoted by d in (G). For eery grah G there exists at least one Inj-domatic artition of V (G), namely {V (G)}. Therefore d in (G) is well-dened for any grah G. Theorem 3.. (i) For any comlete grah K, d in (K ) = d cn (K ) = d(k ) =. (ii) d in (G) = 1 if and only if G has at least one Inj-isolated ertex. (iii) For any wheel grah of ertices, d in (W ) =. (i) For any comlete biartite grah K r,m, d in (K r,m ) = { min{r, m}, if r, m ; 1, otherwise. () For any grah G, if N in () = N() for any ertex in V (G), then d in (G) = d(g). Proof. (i) If G = (V, E) is the comlete grah K, then for any ertex the set {} is a minimum CN-dominating set and also a minimum Inj-dominating set. Then the maximum order of a artition of V (G) into Inj-dominating or CN-dominating sets is. Hence, d in (K ) = d cn (K ) =. (ii) Let G be a grah which has an Inj-isolated ertex say, then eery Inj-dominating set of G must contain the ertex. Then d in (G) = 1. Conersely, if d in (G) = 1 and suose G has no Inj-isolated ertex, then by Theorem.4, γ in (G), so if we suose D is a minimal Inj-dominating set in G, then V D is also a minimal Inj-dominating set. Thus d in (G), a contradiction. Therefore G has at least one Inj-isolated ertex. (iii) Since for eery ertex of the wheel grah the deg in () = 1. Hence, d in (W ) =. (i) and () the roof is obious.
8 ON THE INJECTIVE DOMINATION OF GRAPHS 09 Eidently each CN-dominating set in G is an Inj-dominating set in G, and any CN-domatic artition is an Inj-domatic artition. We hae the following roosition. Proosition 3.3. For any grah G, d in (G) d cn (G). Theorem 3.4. For any grah G with ertices, d in (G) γ in (G). Proof. Assume that d in (G) = d and {D 1, D,..., D d } is a artition of V (G) into d numbers of Inj-dominating sets, clearly D i γ in (G) for i = 1,,..., d and we hae = d D i=1 i dγ in (G). Hence, d in (G) γ in(g). Theorem 3.. For any grah G with ertices, d in (G). δ in(g) Proof. Let D be any subset of V (G) such that D δ in (G). For any ertex V D, we hae N in [] 1 + δ in (G). Therefore N in () D ϕ. Thus D is an Inj-dominating set of G. So, we can take any δ in (G) disjoint subsets each of cardinality δin (G). Hence, d in (G) δ in (G). Theorem 3.. For any grah G with ertices d in (G) δ in (G) + 1. Further the equality holds if G is comlete grah K. Proof. Let G be a grah such that d in (G) > δ in (G) + 1. Then there exists at least δ in (G) + Inj-dominating sets which they are mutually disjoint. Let be any ertex in V (G) such that deg in () = δ in (G). Then there is at least one of the Inj-dominating sets which has no intersection with N in []. Hence, that Inj-dominating set can not dominate, a contradiction. Therefore d in (G) δ in (G) + 1. It is obious if G is comlete, then d in (G) = δ in (G) + 1. Theorem 3.7. For any grah G with ertices, d in (G) + d in (G inj ) + 1 Proof. From Theorem 3., we hae d in (G) δ in (G) + 1 and d in (G inj ) δ in (G inj ) + 1, and clearly δ in (G inj ) = 1 Din(G). Hence, d in (G) + d in (G inj ) δ in (G) + Din(G) Theorem 3.8. For any grah G with ertices and without Inj-isolated ertices, d in (G) + γ in (G) + 1. Proof. Let G be a grah with ertices. Then by Theorem., we hae γ in (G) Din(G) δ in (G), and also from Theorem 3., d in (G) δ in (G) + 1. Then d in (G) + γ in (G) δ in (G) δ in (G). Hence, d in (G) + γ in (G) + 1.
9 10 Anwar Alwardi, R. Rangarajan and Akram Alqesmah References [1] A. Alwardi, B. Arsit'c, I. Gutman and N. D. Soner, The common neighborhood grah and its energy, Iran. J. Math. Sci. Inf., 7(), 1 8 (01). [] Anwar Alwardi, N. D. Soner and Karam Ebadi, On the common neighbourhood domination number, Journal of Comuter and Mathematical Sciences, (3), 47 (011). [3] S. Arumugam, C. Siagnanam, Neighborhood connected and neighborhood total domination in grahs, Proc. Int. Conf. on Disc. Math., 334 B. Chaluaraju, V. Lokesha and C. Nandeesh Kumar Mysore 4 1 (008). [4] B. Chaluaraju, Some arameters on neighborhood number of a grah, Electronic Notes of Discrete Mathematics, Elseier, (009). [] F. Harary, Grah theory, Addison-Wesley, Reading Mass. (199). [] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of domination in grahs, Marcel Dekker, Inc., New York (1998). [7] S. M. Hedetneimi, S. T. Hedetneimi, R. C. Laskar, L. Markus and P. J. Slater, Disjoint dominating sets in grahs, Proc. Int. Conf. on Disc.Math., IMI-IISc, Bangalore (00). [8] V. R. Kulli and S. C. Sigarkanti, Further results on the neighborhood number of a grah, Indian J. Pure and Al. Math. 3(8) 7 77 (199). [9] E. Samathkumar and P. S. Neeralagi, The neighborhood number of a grah, Indian J. Pure and Al. Math. 1() 1 13 (198). [10] H. B. Walikar, B. D. Acharya and E. Samathkumar, Recent deelomentsin the theory of domination in grahs, Mehta Research institute, Allahabad, MRI Lecture Notes in Math. 1 (1979). Author information Anwar Alwardi, Deartment of Mathematics, College of Education, Yafea, Uniersity of Aden, Yemen. a wardi@hotmail.com R. Rangarajan, Deartment of Studies in Mathematics, Uniersity of Mysore, Mysore 70 00, India. rajra3@gmail.com Akram Alqesmah, Deartment of Studies in Mathematics, Uniersity of Mysore, Mysore 70 00, India. aalqesmah@gmail.com Receied: June 17, 01. Acceted: March 1, 017.
Matching Transversal Edge Domination in Graphs
Available at htt://vamuedu/aam Al Al Math ISSN: 19-9466 Vol 11, Issue (December 016), 919-99 Alications and Alied Mathematics: An International Journal (AAM) Matching Transversal Edge Domination in Grahs
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 informationDOMINATION IN DEGREE SPLITTING GRAPHS S , S t. is a set of vertices having at least two vertices and having the same degree and T = V S i
Journal of Analysis and Comutation, Vol 8, No 1, (January-June 2012) : 1-8 ISSN : 0973-2861 J A C Serials Publications DOMINATION IN DEGREE SPLITTING GRAPHS B BASAVANAGOUD 1*, PRASHANT V PATIL 2 AND SUNILKUMAR
More informationThe Dominating Graph DG bcd (G) of a Graph G
The Dominating Grah (G) of a Grah G M. Bhanumathi 1, J. John Flavia 2 1 Associate Professor, Government Arts College for Women, Pudukkottai, TN, India 2 Research Scholar, Government Arts College for Women,
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 informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationA Note on Disjoint Dominating Sets in Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 43, 2099-2110 A Note on Disjoint Dominating Sets in Graphs V. Anusuya Department of Mathematics S.T. Hindu College Nagercoil 629 002 Tamil Nadu, India
More informationACYCLIC WEAK CONVEX DOMINATION IN GRAPHS
International Journal of Mathematics & Engineering with Computers Vol 2, No -2, pp 65-72, January-December 20 ACYCLIC WEAK CONVEX DOMINATION IN GRAPHS TN Janakiraman, and PJA Alphonse ABSTRACT: In a graph
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationA Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs
ISSN 974-9373 Vol. 5 No.3 (2) Journal of International Academy of Physical Sciences pp. 33-37 A Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs R. S. Bhat Manipal Institute
More informationA note on obtaining k dominating sets from a k-dominating function on a tree
A note on obtaining k dominating sets from a k-dominating function on a tree Robert R. Rubalcaba a,, Peter J. Slater a,b a Department of Mathematical Sciences, University of Alabama in Huntsville, AL 35899,
More informationDOMINATION INTEGRITY OF TOTAL GRAPHS
TWMS J. App. Eng. Math. V.4, N.1, 2014, pp. 117-126. DOMINATION INTEGRITY OF TOTAL GRAPHS S. K. VAIDYA 1, N. H. SHAH 2 Abstract. The domination integrity of a simple connected graph G is a measure of vulnerability
More informationInverse and Disjoint Restrained Domination in Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 11, No.1, 2016, 9-15 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 17 August 2016 www.researchmathsci.org International Journal of Inverse and Disjoint
More informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationSOME RESULTS ON THE DISTANCE r-b-coloring IN GRAPHS
TWMS J. App. Eng. Math. V.6, N.2, 2016, pp. 315-323 SOME RESULTS ON THE DISTANCE r-b-coloring IN GRAPHS G. JOTHILAKSHMI 1, A. P. PUSHPALATHA 1, S. SUGANTHI 2, V. SWAMINATHAN 3, Abstract. Given a positive
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 informationMath 751 Lecture Notes Week 3
Math 751 Lecture Notes Week 3 Setember 25, 2014 1 Fundamental grou of a circle Theorem 1. Let φ : Z π 1 (S 1 ) be given by n [ω n ], where ω n : I S 1 R 2 is the loo ω n (s) = (cos(2πns), sin(2πns)). Then
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of
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 informationarxiv: v1 [math.co] 23 Apr 2015
Connectivity of Double Grahs arxiv:504.0696v [math.co] 3 Ar 05 Zhayida Simayijiang and Elkin Vumar College of Mathematics and System Sciences Xinjiang University, Urumqi 830046, P.R.China Abstract The
More informationNORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH
Discussiones Mathematicae Graph Theory 30 (2010 ) 257 263 NORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH Magdalena Lemańska Department of Applied Physics and Mathematics Gdańsk
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationClassification of rings with unit graphs having domination number less than four
REND. SEM. MAT. UNIV. PADOVA, Vol. 133 (2015) DOI 10.4171/RSMUP/133-9 Classification of rings with unit grahs having domination number less than four S. KIANI (*) - H. R. MAIMANI (**) - M. R. POURNAKI
More informationMersenne and Fermat Numbers
NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM
More informationInverse Closed Domination in Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 2 (2016), pp. 1845-1851 Research India Publications http://www.ripublication.com/gjpam.htm Inverse Closed Domination in
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More informationGENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES
GENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES Vladimir D. Samodivkin 7th January 2008 (Dedicated to Mihail Konstantinov on his 60th birthday) Abstract For a graphical property P and a graph G,
More informationExistence of Comfortable Team in some Special Social Networks
Existence of Comfortable Team in some Special Social Networks Abstract Lakshmi Prabha S 1 and T.N.Janakiraman 2,* 1 Department of Mathematics, National Institute of Technology, Trichy-620015, Tamil Nadu,
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 informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationA Study on Integer Additive Set-Graceful Graphs
A Study on Integer Additive Set-Graceful Graphs N. K. Sudev arxiv:1403.3984v3 [math.co] 27 Sep 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur, India. E-mail:
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationRelations between edge removing and edge subdivision concerning domination number of a graph
arxiv:1409.7508v1 [math.co] 26 Sep 2014 Relations between edge removing and edge subdivision concerning domination number of a graph Magdalena Lemańska 1, Joaquín Tey 2, Rita Zuazua 3 1 Gdansk University
More informationPiotr Blass. Jerey Lang
Ulam Quarterly Volume 2, Number 1, 1993 Piotr Blass Deartment of Mathematics Palm Beach Atlantic College West Palm Beach, FL 33402 Joseh Blass Deartment of Mathematics Bowling Green State University Bowling
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationA Public-Key Cryptosystem Based on Lucas Sequences
Palestine Journal of Mathematics Vol. 1(2) (2012), 148 152 Palestine Polytechnic University-PPU 2012 A Public-Key Crytosystem Based on Lucas Sequences Lhoussain El Fadil Communicated by Ayman Badawi MSC2010
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCIT POOJA PATEL Abstract. This aer is an self-contained exosition of the law of uadratic recirocity. We will give two roofs of the Chinese remainder theorem and a roof of uadratic recirocity.
More informationImproved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR AERS VOL. ***, NO. ***, *** 2007 Improed Bounds on the L(2, )-Number of Direct and Strong roducts of Graphs Zhendong Shao, Sandi Klažar, Daid Zhang,
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More informationTHE RAINBOW DOMINATION NUMBER OF A DIGRAPH
Kragujevac Journal of Mathematics Volume 37() (013), Pages 57 68. THE RAINBOW DOMINATION NUMBER OF A DIGRAPH J. AMJADI 1, A. BAHREMANDPOUR 1, S. M. SHEIKHOLESLAMI 1, AND L. VOLKMANN Abstract. Let D = (V,
More informationThe optimal pebbling number of the complete m-ary tree
Discrete Mathematics 222 (2000) 89 00 www.elseier.com/locate/disc The optimal pebbling number of the complete m-ary tree Hung-Lin Fu, Chin-Lin Shiue Department of Applied Mathematics, National Chiao Tung
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationTHE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 4, 2016 THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH HONG-HAI LI AND LI ZOU ABSTRACT. The matching energy of a graph was introduced
More informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More informationIntroduction 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 informationCorrelation of domination parameters with physicochemical properties of octane isomers
Correlation of domination parameters with physicochemical properties of octane isomers Sunilkumar M. Hosamani Department of mathematics, Rani Channamma University, Belgaum, India e-mail: sunilkumar.rcu@gmail.com
More informationExamples from Elements of Theory of Computation. Abstract. Introduction
Examles from Elements of Theory of Comutation Mostafa Ghandehari Samee Ullah Khan Deartment of Comuter Science and Engineering University of Texas at Arlington, TX-7609, USA Tel: +(87)7-5688, Fax: +(87)7-784
More informationA Family of Binary Sequences from Interleaved Construction and their Cryptographic Properties
Contemorary Mathematics A Family of Binary Sequences from Interleaed Construction and their Crytograhic Proerties Jing Jane He, Daniel Panario, and Qiang Wang Abstract. Families of seudorandom sequences
More informationUniversity of Alabama in Huntsville Huntsville, AL 35899, USA
EFFICIENT (j, k)-domination Robert R. Rubalcaba and Peter J. Slater,2 Department of Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899, USA e-mail: r.rubalcaba@gmail.com 2 Department
More informationGraphoidal Tree d - Cover
International J.Math. Combin. Vol. (009), 66-78 Graphoidal ree d - Cover S.SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University, irunelveli 67 01, India) A.NAGARAJAN (Department of
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
More informationVertices contained in all or in no minimum k-dominating sets of a tree
AKCE Int. J. Graphs Comb., 11, No. 1 (2014), pp. 105-113 Vertices contained in all or in no minimum k-dominating sets of a tree Nacéra Meddah and Mostafa Blidia Department of Mathematics University of
More informationTransactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationMinimal dominating sets in maximum domatic partitions
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 52 (2012), Pages 281 292 Minimal dominating sets in maximum domatic partitions S. Arumugam K. Raja Chandrasekar National Centre for Advanced Research in Discrete
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 information3 Properties of Dedekind domains
18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationMaximum graphs with a unique minimum dominatingset
Discrete Mathematics 60 (003) 197 03 www.elsevier.com/locate/disc Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik,
More informationStrong Integer Additive Set-valued Graphs: A Creative Review
Strong Integer Additive Set-valued Graphs: A Creative Review N. K. Sudev arxiv:1504.07132v1 [math.gm] 23 Apr 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationGENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS
GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS PALLAVI DANI 1. Introduction Let Γ be a finitely generated grou and let S be a finite set of generators for Γ. This determines a word metric on
More informationGeneralized connected domination in graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 006, 57 64 Generalized connected domination in graphs Mekkia Kouider 1 and Preben Dahl Vestergaard 1 Laboratoire de Recherche en Informatique,
More informationOn the metric dimension of the total graph of a graph
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 4, 82 95 On the metric dimension of the total graph of a graph B. Sooryanarayana 1, Shreedhar
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationarxiv: v2 [math.gr] 17 Dec 2017
The complement of proper power graphs of finite groups T. Anitha, R. Rajkumar arxiv:1601.03683v2 [math.gr] 17 Dec 2017 Department of Mathematics, The Gandhigram Rural Institute Deemed to be University,
More informationUnit Groups of Semisimple Group Algebras of Abelian p-groups over a Field*
JOURNAL OF ALGEBRA 88, 580589 997 ARTICLE NO. JA96686 Unit Grous of Semisimle Grou Algebras of Abelian -Grous over a Field* Nako A. Nachev and Todor Zh. Mollov Deartment of Algebra, Plodi Uniersity, 4000
More informationDECOMPOSING 4-REGULAR GRAPHS INTO TRIANGLE-FREE 2-FACTORS
SIAMJ.DISCRETE MATH. c 1997 Society for Industrial and Applied Mathematics Vol. 10, No. 2, pp. 309 317, May 1997 011 DECOMPOSING 4-REGULAR GRAPHS INTO TRIANGLE-FREE 2-FACTORS EDWARD BERTRAM AND PETER HORÁK
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationA note on the total domination number of a tree
A note on the total domination number of a tree 1 Mustapha Chellali and 2 Teresa W. Haynes 1 Department of Mathematics, University of Blida. B.P. 270, Blida, Algeria. E-mail: m_chellali@yahoo.com 2 Department
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 09/25 Partitioning a graph into a dominating set, a total dominating set, and something else Henning, Michael A.; Löwenstein, Christian;
More informationCO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS. S.Padmashini 1 and K.Nagarajan 2. Sri S.R.N.M.College,
International Journal of Science, Engineering and Technology Research (IJSETR), Volume 5, Issue 3, March 016 CO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS S.Padmashini 1 and K.Nagarajan 1 M.Phil
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 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 informationDistance in Graphs - Taking the Long View
AKCE J Graphs Combin, 1, No 1 (2004) 1-13 istance in Graphs - Taking the Long View Gary Chartrand 1 and Ping Zhang 2 epartment of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA 1 e-mail:
More informationThe Exquisite Integer Additive Set-Labeling of Graphs
The Exquisite Integer Additive Set-Labeling of Graphs N. K. Sudev 1, K. A. Germina 2 Department of Mathematics, Vidya Academy of Science & Technology, Thalakkottukara, Thrissur - 680501, Kerala, India.
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationOn (a, d)-vertex-antimagic total labeling of Harary graphs
On (a, d)-ertex-antimagic total labeling of Harary graphs M. Hussain 1, Kashif Ali 1, M. T. Rahim, Edy Tri Baskoro 3 1 COMSATS Institute of Information Technology, Lahore Campus, Pakistan {muhammad.hussain,kashif.ali}@ciitlahore.edu.pk
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationDominator Colorings and Safe Clique Partitions
Dominator Colorings and Safe Clique Partitions Ralucca Gera, Craig Rasmussen Naval Postgraduate School Monterey, CA 994, USA {rgera,ras}@npsedu and Steve Horton United States Military Academy West Point,
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationON FREIMAN S 2.4-THEOREM
ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained
More information#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS
#A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom
More informationD.K.M.College for Women (Autonomous), Vellore , Tamilnadu, India.
American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 38-3491, ISSN (Online): 38-3580, ISSN (CD-ROM): 38-369
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More informationChords in Graphs. Department of Mathematics Texas State University-San Marcos San Marcos, TX Haidong Wu
AUSTRALASIAN JOURNAL OF COMBINATORICS Volme 32 (2005), Pages 117 124 Chords in Graphs Weizhen G Xingde Jia Department of Mathematics Texas State Uniersity-San Marcos San Marcos, TX 78666 Haidong W Department
More informationSome New Approaches for Computation of Domination Polynomial of Specific Graphs
Journal of Mathematical Extension Vol. 8, No. 2, (2014), 1-9 Some New Approaches for Computation of Domination Polynomial of Specific Graphs S. Alikhani Yazd University E. Mahmoudi Yazd University M. R.
More informationThe adjacent vertex-distinguishing total chromatic number of 1-tree
The adjacent ertex-distinguishing total chromatic number of 1-tree Haiying Wang The School of Information Engineering China Uniersity of Geosciences(Beijing) Beijing 100083, P.R.China Abstract Let G =
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
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 informationSUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP OF THE NORMALIZER OF. 2p, p is a prime and p 1 mod4
Iranian Journal of Science & Technology, Transaction A, Vol. 34, No. A4 Printed in the Islamic Reublic of Iran, Shiraz University SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP * m OF THE NORMALIZER OF S. KADER,
More information3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three
Vol.3, Issue.1, Jan-Feb. 2013 pp-231-239 ISSN: 2249-6645 3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three Selvam Avadayappan, 1 S. Kalaimathy, 2 G. Mahadevan 3 1, 2 Department
More information