LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF PATHS AND CYCLES
|
|
- Blake Walton
- 5 years ago
- Views:
Transcription
1 BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) , ISSN (o) /JOURNALS / BULLETIN Vol. 7(017), DOI: /BIMVI Ç Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN (o), ISSN X (p) LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF PATHS AND CYCLES Canan Çiftçi and Pinar Dündar Abstract. Graph coloring is one of the most important concept in graph theory. There are many types of coloring. We study on the local connective chromatic number of a graph G that is defined by us. In this paper, we determine the local connective chromatic number of the direct product of two paths P m P n, two cycles C m C n and for the direct product of a cycle and a path C m P n, where m and n are the number of vertices. 1. Introduction Let G be a simple undirected graph, where V (G) and E(G) denote the set of vertices and the set of edges of G, respectively. For two vertices u, v V (G), u and v are adjacent if they are joined by an edge. Two vertices that are not adjacent in a graph G are said to be independent. The independence number β(g) of a graph G is the maximum cardinality among the independent sets of vertices of G. For the notations and terminology not defined here, we follow [6]. The connectivity κ = κ(g) of a graph G is the minimum number of vertices whose removal results in a disconnected or trivial graph. Two paths are internally disjoint (vertex disjoint) if they do not share a common vertex except their end vertices. The local connectivity κ G (u, v) = κ(u, v) between two distinct vertices u and v of a graph G is defined as the smallest number of vertices whose removal separates u and v. By Menger s theorem [14], κ(u, v) equals the maximum number of internally disjoint u v paths in G and κ(g) = min{κ(u, v) : u, v V (G)}. It is straightforward to verify that κ(g) δ(g) and κ(u, v) min{deg(u), deg(v)} [16]. 010 Mathematics Subject Classification. 05C15, 05C76. Key words and phrases. Local connective chromatic number, Internally disjoint path, Direct product. 561
2 56 C. ÇIFTÇI AND P. DÜNDAR The local connective coloring is defined by us by inspiring the notion of packing coloring [5, 9, 1, 18]. Routing is the process of delivering messages among vertices and selecting the best paths in a network. Efficiency and reliability of routing can be achieved by using internally disjoint paths because the failure of a path would not affect the performance of other paths. Then the more internally disjoint paths are the better for a network [13]. Thus, we use the term internally disjoint path in our coloring and color the vertices depending on the number of internally disjoint paths between two vertices. A graph G which has a local connective k- coloring can be partitioned into disjoint color classes X 1, X,..., X k and can be drawn as a k-partite graph. Thereby, the graph is partitioned into the subsets which have disjoint paths. Looking for a secure disjoint path between two vertices u and v in any color class X i, we make this search with the vertices in the other color classes. This indicate that we look for disjoint paths starting from u and ending to v using the vertices in the other color classes. Thus, this search can be made with V (G) ( X i ) vertices. Thereby, NP-complete problem can be solved more easily. Local connective coloring provides to facilitate the routing of non adjacent vertices to communicate with each other. The direct product G H of two graphs G and H is a graph with V (G H) = V (G) V (H) and E(G H) = {(u 1, v 1 )(u, v ) : u 1 u E(G) and v 1 v E(H)}. It is also known as Kronecker product, tensor product, categorical product and graph conjunction. This graph product is commutative and associative [3]. The direct product of graphs has been extensively investigated concerning graph recognition and decomposition, graph embeddings, matching theory and stability in graphs [1, 4]. More generally, the direct product is a widely used tool in the area of graph colorings [11]. Lemma 1.1. [17] Let G be a connected graph. If G has no odd cycle, then G K has exactly two connected components isomorphic to G. Theorem 1.1. [17] Let G and H be connected graphs. The graph G H is connected if and only if any G or H contains an odd cycle. Corollary 1.1. [17] If G and H are connected graphs with no odd cycles then G H has exactly two connected components. Theorem 1.. [15] Let G = (V, E) be a connected graph, and H = (V 1, V, E ) be a bipartite connected graph, then G H is a bipartite graph, the partition of the vertex set is (V V 1 ) and (V V ). Theorem 1.3. [8] The direct product of two connected graphs is a non connected graph if and only if both are bipartite. Lemma 1.. [10] If G = (V 0 V 1, E) and H = (W 0 W 1, F ) are bipartite graphs, then (V 0 W 0 ) (V 1 W 1 ) and (V 0 W 1 ) (V 1 W 0 ) are vertex sets of the two components of G H. Lemma 1.3. [10] If G is a connected, bipartite graph and n 4 is an even integer, then the graph G C n consists of two isomorphic connected components.
3 LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF Theorem 1.4. [] If G and H are regular graphs then G H is also a regular graph.. Local Connective Chromatic Number of Direct Product Graphs Definition.1. A local connective k-coloring of a graph G is a mapping c : V (G) {1,,..., k} such that (1) If uv E(G), then c(u) c(v), and () If uv / E(G) and c(u) = c(v) = i, then κ(u, v) i, where κ(u, v) is the maximum number of internally disjoint paths between u and v. The smallest integer k for which there exists a local connective k- coloring of G is called the local connective chromatic number of G, and it is denoted by χ lc (G). The first condition characterizes proper coloring. Thus, every local connective coloring is a proper coloring. The vertices of G are partitioned into disjoint color classes X 1, X,..., X k, where each color class X i consists of distinct vertices u, v X i such that κ(u, v) i and n X i = V (G). The maximum cardinality of X i in G is denoted by k i. i=1 In this section, we give local connective chromatic number of direct product of paths and cycles. Let G and H be any two graphs with vertex sets V (G) = {u 1, u,..., u m }, V (H) = {v 1, v,..., v n }, respectively. A vertex (u i, v j ) is abbreviated as w ij, where w ij V (G H), i {1,,..., m}, j {1,,..., n}. Theorem.1. Let P m and P n be two paths of order m and n, respectively. Then, 4 χ lc (P m P n ) max{n + 5, m + n + 7} for m n. Proof. It is known that paths are bipartite graphs. By Theorem 1.3, the graph P m P n is non connected for m and n being odd or even. Further by Corollary 1.1, P m P n has two connected components as G 1 and G. Since δ(g 1 ) = δ(g ) = and (G 1 ) = (G ) = 4, we have κ(w ij, w kl ) 4, where w ij, w kl V (G 1 )(or V (G )), i, k {1,,..., m}, j, l {1,,..., n}. Thus, k i 1 for i 5. That is, the pair of vertices can be colored with the same color at most color 4, and the remaining uncolored vertices receive different colors. We prove this theorem in four cases for m and n being odd or even. Case 1. Let m and n be odd. Since V (P m P n ) = mn, we have V (G 1 ) = mn, V (G ) = mn. The graph P m P n has four vertices of each of degree one in the only one component. Assume that these vertices be in the component G 1. Since there is one internally disjoint path between these vertices, they can be colored with color 1. The vertex w ij can be colored with color 1, where i {1, 3,..., m}, j {1, 3,..., n}. Thus, β(g 1 ) = n m vertices in G 1 are colored with color 1, and n m vertices in G 1 remain uncolored. n m < mn and thus color the graph G with color. When we start coloring from the vertex w 1 and color all vertices which are not adjacent with each other in G, then maximum n m vertices in G are colored
4 564 C. ÇIFTÇI AND P. DÜNDAR Figure 1. Local connective coloring of P 5 P 7 with color. Thus, there are n m and n m uncolored vertices in G and G, respectively. Case 1.1. Let m = 3 and n 3. For all vertices w ij, w kl in G 1 or G, we have κ(w ij, w kl ), where i, k {1,, 3}, j, l {1,,..., n}. Thus, there is not any vertex colored with color 3 and color 4. Hence, the remaining n m vertices are colored with different colors. Then we have χ lc (P 3 P n ) = + n m = n +. Case 1.. Let m = 5 and n 5. Since κ(g 1 ) = 1, κ(g ) =, we have κ(w ij, w kl ), where w ij, w kl V (G ). Four vertices in P 5 P n are colored with color 3. Color the vertex w ij in G with color 3 for the minimum local connective coloring number, where i {, 4}, j {3, 5}. Case If m = n = 5, no vertices that remain uncolored in G 1 or G are colored with color 4. Thus, the remaining vertices receive different colors and we have χ lc (P 5 P 5 ) = 3 + n m 4 = 9. Case 1... If m = 5 and n 7, the vertex w i4 for i {, 4} in G 1 is colored with color 4. The remaining n m 6 = n 6 vertices receive different colors. Thus, we have χ lc (P 5 P n ) = n. Case 1.3. Let m 7 and n 7. Take the vertex w ij in G 1, where i {, 4,..., m 1}, j {, 4,..., n 1}. The number of internally disjoint paths between these vertices is at most 4. Thus, maximum ( m 1 n 1 )( ) vertices are colored with color 3, and there is no vertex in G 1 remains uncolored.
5 LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF Case If m = n = 7, the number of internally disjoint paths between only two vertices in G is 4. Hence, these vertices receive color 4, and we have χ lc (P 7 P 7 ) = 4 + m n = 14. Case Let m = 7 and n 9. Since m = 7, there are four vertices in G that the number of internally disjoint paths between them is 4. Thus, these four vertices receive color 4, and we have χ lc (P 7 P n ) = 4 + m n 4 = 3 (n + 1). Case Let m 9 and n 9. Take the vertices w ij, where i {4, 6, 8,..., m 3}, j {3, 5, 7,..., n } and w kl, where k {, m 1}, l {5, 7, 9,..., n 4} in G. Since the number of internally disjoint paths between them is 4, m 4 n 3 n 6 ( ) + vertices are colored with color 4. Hence, the remaining m + 3 vertices receive m + 3 different colors, and we have χ lc (P m P n ) = 4 + m + 3 = m + 7. Consequently, if m and n are odd, then we have n +, m = 3, n 3 9, m = n = 5 n, m = 5, n 7 χ lc (P m P n ) = 14, m = n = 7 3 (n + 1), m = 7, n 9 m + 7, m 9, n 9. Case. Let m be even and n be odd. V (P m P n ) = mn and V (G 1 ) = V (G ) = mn. The graph P m P n has four vertices of each of degree one. Two of them are in G 1 and the other two vertices are in G. Assume that we start coloring from the vertex w 11 in G 1. Assign color 1 to every vertex when i and j are odd. Thus, β(g 1 ) = m n vertices are colored with color 1. The graph G 1 has n uncolored vertices of degree and n ( m 1) uncolored vertices each of degree 4. Then the total number of the remaining uncolored vertices in G 1 is n m. Start coloring the graph G with color for the minimum number of local connective coloring. Assume that we start coloring from the vertex w 1. The graph mn G has total vertices of degree two and four, and since the number of internally disjoint paths between these vertices is at least, each vertex which is not adjacent with each other is colored with color. Thus, the vertices w ij, where i {, 4, 6,..., m }, j {1, 3, 5,..., n} and w nl, where l {3, 5, 7,..., n } are colored with color. Then maximum n m ( ) + n 3 = m n vertices in G receive color. Among the remaining + n m vertices in G, two of them have degree one, n of them are each of degree and n ( m 1) of them are each of degree 4. Thus, there are + n m vertices in the graph P m P n remain uncolored. Case.1. Let m = and n 3. In this case, P n = G1, P n = G and P P n = Pn. Since χ lc (P n ) = 1 + n
6 566 C. ÇIFTÇI AND P. DÜNDAR by [7], we get χ lc (P P n ) = n + χ lc (P n ) = n n = 3n + 1. Case.. Let m = 4 and n 5. Since κ(w ij, w kl ), where w ij, w kl V (G 1 )(or V (G )) there is not any vertex colored with color 3 and 4. Hence, the remaining m n + = n vertices receive different colors. Then we haveχ lc (P 4 P n ) = n +. Case.3. Let m 6 and n 7. Every pair of vertices in G 1 each of degree 4 satisfy the condition κ(w ij, w kl ) 3, where i, k {, 4,..., m }, j, l {, 4,..., n 1}. Thus, n ( m 1) vertices are colored with color 3. The number of the remaining vertices in G 1 is n and each of them has degree two. Further, these vertices satisfy the condition κ(w mj, w ml ), where j, l {, 4,..., n 1},j l. Then they receive different colors. Hence, we have χ lc (G 1 ) = + n. Consider coloring the graph G. For the vertices w ij, where i {5, 7, 9,..., m 3}, j {, 4, 6,..., n 1} and w kl, where k {3, m 1}, l {4, 6, 8,..., n 3}, the number of internally disjoint paths between them are 4 and so m 5 n 1 n 4 ( )+ vertices are colored with color 4. The remaining n+11 vertices in G receive different colors. Thus, χ lc (G ) = + n+11, and we have χ lc (P m P n ) = χ lc (G 1 ) + χ lc (G ) = n + 9. Consequently, if m is even and n is odd, then we have 3n+1, m =, n 3 χ lc (P m P n ) = n +, m = 4, n 5 n + 9, m 6, n 7. Case 3. Let m be odd and n be even. The graph P m P n has four vertices of each of degree one. Two of them are in G 1 and the other two vertices are in G. If we color the vertices of G 1 starting from the vertex w 11 as Case, n m vertices receive color 1. For color, assume that we start coloring from the vertex w 1 in G. The vertices w ij, where i {3, 5, 7,..., m }, j {, 4, 6,..., n} and w kl, where k {1, m}, l {, 4, 6,..., n } are colored with color. There are at most (m 3)n 4 + (n ) = m n vertices which receive color. Thus, m n + vertices remain uncolored in P m P n. Case 3.1. Let m = 3 and n 4. In this case, κ(w ij, w kl ), where w ij, w kl V (G 1 )(or V (G )), i, k {1,, 3}, j, l {1,,..., n}. Thus, there is not any pair of vertices that is colored with color 3 or color 4. Then we have χ lc (P 3 P n ) = + m n + = n + 4. Case 3.. Let m = 5 and n 6. If κ(w ij, w kl ) 3 or deg(w ij ) 3, where i, k {1,,..., m}, j, l {1,,..., n}, any two vertices w ij and w kl can be colored with color 3. Thus, there are m ( n 1)
7 LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF vertices in G 1 each of degree 4 that can be colored with color 3. Since m = 5, only four vertices of them are colored with color 3. Case If m = 5 and n = 6, there is not any pair of vertices which receives color 4. Hence, the remaining vertices are colored with different colors, and so we have χ lc (P 5 P 6 ) = 3 + m n + 4 = 13. Case 3... Let m = 5 and n 8. The number of internally disjoint paths between only two vertices in G is 4. Thus, these two vertices are colored with color 4. Since the remaining n 4 vertices receive different colors, we have χ lc (P 5 P n ) = n. Case 3.3. Let m 7 and n 8. Since m 7, in G 1 there are m ( n 1) vertices each of degree 4 which are colored with color 3. Thus, we have χ lc (G 1 ) = + m n m (n 1) = + m. Case If m = 7 and n 8, only four vertices in G can be colored with color 4. Since the remaining n m vertices in G receive different colors, χ lc (G ) = + n m = 3n, and we have χ lc(p 7 P n ) = χ lc (G 1 ) + χ lc (G ) = 3n + 5. Case Let m 9 and n 10. For the minimum number of local connective coloring consider the vertices w ij, where i {4, 6,..., m 3}, j {3, 5,..., n 1} and w kl, where k {, m 1}, l {5, 7,..., n 3} in G. Since the number of internally disjoint paths between these m 4 n n 5 ( ) + vertices is 4, they are colored with color 4. The remaining m+11 vertices in G receive different colors. Hence, χ lc (G ) = + m+11 and we have χ lc (P m P n ) = χ lc (G 1 ) + χ lc (G ) = m + 9. Consequently, if m is odd and n is even, then we get n + 4, m = 3, n 4 13, m = 5, n = 6 χ lc (P m P n ) = n, m = 5, n 8 3n + 5, m = 7, n 8 m + 9, m 9, n 10. Case 4. Let m and n be even. In this case, V (G 1 ) = V (G ) = mn. The graph P m P n has four vertices of each of degree one. Two of them are in G 1 and the other two vertices are in G. Assume that we start coloring the graph from the vertex w 11 in G 1, and assign color 1 to every vertex w ij when i and j are not both even. Thus, β(g 1 ) = mn 4 vertices are colored with color 1 and mn 4 vertices in G 1 remain uncolored. For color, assume that we start coloring the graph G from the vertex w 1, and consider the vertices w ij, where i {, 4,..., m }, j {1, 3,..., n 1} and w nl, where l {3, 5,..., n 1}. Thus, ( m ) n 1 + n = mn 4 1 vertices in G
8 568 C. ÇIFTÇI AND P. DÜNDAR are colored with color, and the number of the remaining uncolored vertices in G is mn Case 4.1. Let m = and n. Since P P n = Pn and χ lc (P n ) = 1 + n by [7], we have χ lc (P P n ) = n + χ lc (P n ) = n n = 3n + 1. Case 4.. Let m = 4 and n 4. Since m = 4, there is not any pair of vertices which is colored with color 3 and color 4. Hence, we have χ lc (P 4 P n ) = + mn + 1 = n + 3. Case 4.3. Let m 6 and n 6. For every vertex of degree 4 in G 1 which is not adjacent with each other κ(w ij, w kl ) 3 is satisfied, where i, k {, 4,..., m }, j, l {, 4,..., n }. Thus, ( m n m+n )( ) vertices are colored with color 3, and 1 vertices in G 1 remain uncolored. Since the number of internally disjoint paths between these remaining vertices is at most, all of them receive different colors. Hence, we have χ lc (G 1 ) = 1 + m+n. Case Let m = n = 6. Since there is not any pair of vertices in G which is colored with color 4, we have χ lc (P 6 P 6 ) = χ lc (G 1 ) mn = 18. Case Let m = 6, n 8. The number of internally disjoint paths between only two vertices in G is 4. Thus, the remaining mn 4 1 vertices receive different colors, and we have χ lc (P 6 P n ) = χ lc (G 1 ) + + mn 4 1 = n + 5. Case Let m 8 and n 8. Consider the vertices w ij, where i {5, 7,..., m 3}, j {, 4,..., n } and w kl, where k {3, m 1}, l {4, 6,..., n 4} in G. The number of internally disjoint paths between these vertices is 4. Thus, m 5 n n 5 ( ) + = mn 4 m+n 3 vertices receive color 4. The remaining m+n + 4 vertices receive different colors. Then χ lc (G ) = 6+ m+n and we have χ lc (P m P n ) = χ lc (G 1 )+χ lc (G ) = m+n+7. As a result, if m and n is even, we have 3n+1, m =, n n + 3, m = 5, n 4 χ lc (P m P n ) = 18, m = n = 6 n + 5, m = 6, n 6 m + n + 7, m 8, n 8. By summing up four cases we have the statement of Theorem. Theorem.. Let C m and P n be cycle and path of order m and n, respectively. Then,
9 LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF , if m is odd m +, if m is even, n = χ lc (C m P n ) = m + 3, if m is even, n = 3 m + 4, if m is even, n 4 even or m is even, n 5 odd Proof. Since deg(w ij ) = deg(u i ) deg(v j ), we have κ(w ij, w kl ) min{w ij, w kl } 4, where w ij, w kl V (C m P n ), i, k {1,,..., m}, j, l {1,,..., n}. Thus, k i 1 for i 5, and the pair of vertices can be colored with the same color at most color 4. We have following two cases for coloring the graph C m P n. Figure. Local connective coloring of C 5 P 7 Case 1. Let m and n be odd or m be odd and n be even. By Theorem 1.1, since m is odd, the graph C m P n is connected, and by Theorem 1., C m P n is bipartite graph. Let C m P n = (V 1 V, E). Since κ(w ij, w kl ) 4, where w ij, w kl V (C m P n ), i, k {1,,..., m}, j, l {1,,..., n}, the vertices of V 1 and V can be colored with color 1 and color, respectively. Then we have χ lc (C m P n ) =. Case. Let m and n be even or m be even and n be odd. In this case, since cycles and paths are bipartite graphs, let C m = (V 0 V 1, E), P n = (W 0 W 1, F ). By Theorem 1.3 and Theorem 1., the graph C m P n is non-connected bipartite graph. Further, by Lemma 1. and 1.3, G 1 = ((V 0 W 0 ) (V 1 W 1 ), E F ) and G = ((V 0 W 1 ) (V 1 W 0 ), E F ) are two bipartite components of C m P n. Since G 1 is bipartite graph, χ lc (G 1 ) = by Case 1. Let s start coloring the graph G with color χ lc (G 1 ) + 1 = 3.
10 570 C. ÇIFTÇI AND P. DÜNDAR Since V (C m P n ) = V (C m ) V (P n ), it is obvious that V (C n ) = V (P m ) = mn. Case.1. Let n = and m be even. Since P = K, by Lemma 1.1 the graph C m K has exactly two connected components G 1 and G isomorphic to C m. Since G is regular graph, the number of internally disjoint paths between all two vertices in G is at most. Thus, all vertices of G receive different colors. Then, χ lc (C m P ) = χ lc (G 1 ) + χ lc (G ) = m +. Case.. Let n = 3 and m be even. In this case, the graph G has m(n ) = m vertices of degree 4, and these vertices are either in the vertex set V 0 W 1 or in V 1 W 0. That is, these vertices are not adjacent. Thus, m vertices are colored with color 3. The number of the remaining uncolored vertices is m. Since the degree of these remaining vertices is, these m vertices receive different colors. Thus, we have χ lc (C m P 3 ) = χ lc (G 1 ) + χ lc (G ) = m = m + 3. Case.3. Let m be even and n 4 even or m be even and n 5 odd. The graph C m P n has m(n ) vertices each of degree 4, and G has half of these vertices. The vertex sets W 0 and W 1 have n n and internal vertices of P n, respectively. Since κ(w ij, w kl ) 4, where w ij, w kl V (G ), we color m n vertices of G with color 3 and m n vertices of G with color 4. The remaining m vertices receive different colors. Thus, we have χ lc (C m P n ) = χ lc (G 1 ) + χ lc (G ) = + + m = m + 4. Theorem.3. Let C m and C n be two cycles of order m and n, respectively. Then,, if m is odd, n is even or m is even, n is odd χ lc (C m C n ) = 3, if m and n are odd 4, if m and n are even. Proof. By proof of Theorem 1.4, the graph C m C n is 4 regular graph. Then the number of internally disjoint paths between any two vertices in C m C n is at most 4. Hence, k i 1 for i 5. We have following three cases for coloring the graph C m C n. Case 1. Let m be odd and n be even or m be even and n be odd. It is known that if the order of a cycle is even, it is bipartite graph. Thus, by Theorem 1.1 and Theorem 1., the graph C m C n is bipartite connected graph. Since the number of internally disjoint paths between any two vertices in C m C n is at most 4, we have χ lc (C m C n ) =. Case. Let m and n be even. Since m and n are even, C m and C n are bipartite graphs. By Theorem 1., Theorem 1.3 and Lemma 1.3, the graph C m C n is bipartite non-connected graph
11 LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF Figure 3. Local connective coloring of C 5 C 7 and has exactly two isomorpic connected components G 1 and G. Thus, these components are also bipartite graphs. Since G 1 is bipartite graph and the number of internally disjoint paths between any two vertices of G 1 is at most 4, we have χ lc (G 1 ) =. Let s start coloring the graph G with color χ lc (G 1 )+1 = 3. Since G is also bipartite graph and the number of internally disjoint paths between any two vertices of G is at most 4, the vertices of G receive color 3 and color 4. Hence, χ lc (C m C n ) = 4. Case 3. Let m and n be odd. Since m and n are odd, the graph C m C n is connected by Theorem 1.1. Assume that we start coloring the graph from the vertex w 11. By definition of direct product, the vertex w 1j can be colored with color 1 for j {1,,..., n}. Thus we color all non adjacent vertices w 1j, w 3j, w 5j,...,w (m )j with color 1. Since the vertices w j, w 4j, w 6j,...,w (m 1)j are not adjacent with each other, and the number of internally disjoint paths between them is at most 4, these vertices receive color. Then total n(m 1) vertices in C m C n are colored with color 1 and color. Hence, the vertex w mj remains uncolored and the number of its vertices is mn n(m 1) = n. Since the vertex w mj is adjacent to the vertices w 1j and w (m 1)j, the vertex w mj is colored with different color other than color 1 and color. Thus, all vertices in the graph C m C n are colored with three local connective colors. 3. Conclusion In this paper, we define a new type of graph coloring called local connective coloring. It is known that a communication network is fault-tolerant if it has alternative paths (internally disjoint paths) between vertices and the internally disjoint paths are used to transmit messages among vertices. Thus, we use the
12 57 C. ÇIFTÇI AND P. DÜNDAR term internally disjoint path in our coloring and color the vertices depending on the number of internally disjoint paths between two vertices. In our work, we study on the local connective chromatic number of direct product of some cycles and paths. We can consider the local connective chromatic number of Cartesian product of graphs in further study. References [1] N. Alon, E. Lubetzky. Independent sets in tensor graph powers. J. Graph Theory, 54(1)(007), [] Dr.P. Bhaskarudu. Some results on kronecker product of two graphs. International Journal of Mathematics Trends and Technology, 1(01), [3] A. Bottreau and Y. Metivier. Some remarks on the kronecker product of graphs. Information Processing Letters, 68(1998), [4] B. Brešar, W. Imrich, S. Klavžar and B. Zmazek. Hypercubes as direct products. SIAM J. Discrete Math., 18(4)(005), [5] B. Brešar, S. Klavžar, and D.F. Rall. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discrete Appl. Math., 155(007), [6] G. Chartrand, L. Lesniak and P. Zhang, Graphs & Digraphs, Fifth edition. Taylor & Francis, 005. [7] C. Çiftçi and P. Dündar. Some Bounds on Local Connective Chromatic Number. submitted, 016. [8] M. Farzan and D.S.Waller. Kronecker products and local joins of graphs. Canad. J. Math., 9()(1977), [9] W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, J. M. Harris and D. F. Rall. Broadcast chromatic numbers of graphs. Ars Combinatoria, 86(008), [10] P.K. Jha. Hamiltonian decompositions of products of cycles. Indian J. Pure Appl. Math., 3(10)(199), [11] S. Klavžar. Coloring graph products - A survey. Discrete Math., 155(1996), [1] M. Klešč and Š. Schrtter. On the packing chromatic number of semiregular polyhedra. Acta Electrotechnica et Informatica, 1(01), [13] C.N. Lai. Optimal construction of all shortest node-disjoint paths in hypercubes with applications. IEEE Transactions on Parallel and Distributed Systems, 3(01), [14] K. Menger. Zur allgemeinen Kurventheorie. Fundementa Mathematicae, 10(197), [15] D. J. Miller. The categorical product of graphs. Canad. J. Math., 0 (6)(1968), [16] L. Volkmann. On local connectivity of graphs. Applied Mathematics Letters, 1(008), [17] P.M. Weichsel. The kronecker product of graphs. Proceedings of the American Mathematical Society, 13(1)(196), [18] A. William and S. Roy. Packing chromatic number of cycle related graphs. International Journal of Mathematics and Soft Computing, 4(014), Received by editors ; Available online Department of Mathematics, Faculty of Science, Ege University,35100, Izmir/Turkey address: canan.ciftci@ege.edu.tr Department of Mathematics, Faculty of Science, Ege University,35100, Izmir/Turkey address: pinar.dundar@ege.edu.tr
LOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS
LOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS ROMANIAN JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 08, VOLUME 8, ISSUE, p-7 CANAN C IFTC I AND PINAR DU NDAR Abstract A local connective
More informationON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA
Acta Electrotechnica et Informatica, Vol., No., 0, 7, DOI: 0.478/v098-0-007-7 ON THE PACKING CHROMATIC NUMBER OF SEMIREGULAR POLYHEDRA Marián KLEŠČ, Štefan SCHRÖTTER Department of Mathematics and Theoretical
More informationPacking Chromatic Number of Cycle Related Graphs
International Journal of Mathematics and Soft Computing Vol., No. (0), 7 -. ISSN Print : 9-8 ISSN Online: 9 - Packing Chromatic Number of Cycle Related Graphs Albert William, S. Roy Department of Mathematics,
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationApplied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap
Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University
More informationTHE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(1)(2017), 23-30 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationS. K. Vaidya and Rakhimol V. Isaac
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(2015), 191-195 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationTotal domination numbers of cartesian products
Mathematical Communications 9(2004), 35-44 35 Total domination numbers of cartesian products A. Klobučar Abstract. Let GH denote the cartesian product of graphs G and H. Here we determine the total domination
More informationThe Restrained Edge Geodetic Number of a Graph
International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge
More informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationSIGN DOMINATING SWITCHED INVARIANTS OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-87, ISSN (o) 0-955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 5-6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA LUKA
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationDouble Vertex Graphs and Complete Double Vertex Graphs. Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007
Double Vertex Graphs and Complete Double Vertex Graphs Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007 Abstract Let G = (V, E) be a graph of order n 2. The double vertex graph,
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationPacking chromatic number of base-3 Sierpiński graphs
Noname manuscript No. (will be inserted by the editor) Packing chromatic number of base-3 Sierpiński graphs Boštjan Brešar Sandi Klavžar Douglas F. Rall Received: date / Accepted: date Abstract The packing
More informationThe packing chromatic number of infinite product graphs
The packing chromatic number of infinite product graphs Jiří Fiala a Sandi Klavžar b Bernard Lidický a a Department of Applied Mathematics and Inst. for Theoretical Computer Science (ITI), Charles University,
More informationarxiv: v1 [math.co] 4 Apr 2011
arxiv:1104.0510v1 [math.co] 4 Apr 2011 Minimal non-extensible precolorings and implicit-relations José Antonio Martín H. Abstract. In this paper I study a variant of the general vertex coloring problem
More informationTHE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction
MATEMATIQKI VESNIK 67, 2 (2015), 102 114 June 2015 originalni nauqni rad research paper THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS N. Dehgardi, S. M. Sheikholeslami and L. Volkmann Abstract.
More informationSparse Hypercube 3-Spanners
Sparse Hypercube 3-Spanners W. Duckworth and M. Zito Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3052, Australia Department of Computer Science, University of
More informationAverage D-distance Between Edges of a Graph
Indian Journal of Science and Technology, Vol 8(), 5 56, January 05 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 OI : 07485/ijst/05/v8i/58066 Average -distance Between Edges of a Graph Reddy Babu
More informationPacking chromatic number of base-3 Sierpiński graphs
Packing chromatic number of base-3 Sierpiński graphs Boštjan Brešar a,b Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia b Institute
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationAVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH
italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.
More informationA note on isolate domination
Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura
More informationComplementary Acyclic Weak Domination Preserving Sets
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 30-9364, ISSN (Print): 30-9356 ijresorg Volume 4 Issue 7 ǁ July 016 ǁ PP 44-48 Complementary Acyclic Weak Domination
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationA generalization of zero divisor graphs associated to commutative rings
Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:9 https://doi.org/10.1007/s12044-018-0389-0 A generalization of zero divisor graphs associated to commutative rings M. AFKHAMI 1, A. ERFANIAN 2,, K. KHASHYARMANESH
More informationPacking Chromatic Number of Distance Graphs
Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub Bernard Lidicky y May 25, 2011 Abstract The packing chromatic number (G) of a graph G is the smallest integer k such that vertices
More informationOn Balance Index Set of Double graphs and Derived graphs
International Journal of Mathematics and Soft Computing Vol.4, No. (014), 81-93. ISSN Print : 49-338 ISSN Online: 319-515 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas
More informationChromatic Transversal Domatic Number of Graphs
International Mathematical Forum, 5, 010, no. 13, 639-648 Chromatic Transversal Domatic Number of Graphs L. Benedict Michael Raj 1, S. K. Ayyaswamy and I. Sahul Hamid 3 1 Department of Mathematics, St.
More informationBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 2 (2018), pp 1-13 DOI: 10.7508/ijmsi.2018.13.001 Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
More informationTriple Domination Number and it s Chromatic Number of Graphs
Triple Domination Number and it s Chromatic Number of Graphs A.Nellai Murugan 1 Assoc. Prof. of Mathematics, V.O.Chidambaram, College, Thoothukudi-628 008, Tamilnadu, India anellai.vocc@gmail.com G.Victor
More informationOn Sequential Topogenic Graphs
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary
More informationOn the extending of k-regular graphs and their strong defining spectrum
On the extending of k-regular graphs and their strong defining spectrum Doost Ali Mojdeh Department of Mathematics University of Mazandaran P. O. Box 47416-1467 Babolsar Iran Abstract In a given graph
More informationMonophonic Chromatic Parameter in a Connected Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 19, 911-920 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.78114 Monophonic Chromatic Parameter in a Connected Graph M.
More informationON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 017 (137 144) 137 ON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS Xianya Geng Zhixiang Yin Xianwen Fang Department of Mathematics and Physics
More informationNetwork flows and Menger s theorem
Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationFormer Bulletin of Society of Mathematicians Banja Luka ISSN (p), ISSN X (o)
Bulletin of International Mathematical Virtual Institute ISSN 1840-4359 Vol. 1(2011), 39-43 Former Bulletin of Society of Mathematicians Banja Luka ISSN 0354-5792 (p), ISSN 1986-521X (o) COMPLEMENT FREE
More informationTriple Connected Domination Number of a Graph
International J.Math. Combin. Vol.3(2012), 93-104 Triple Connected Domination Number of a Graph G.Mahadevan, Selvam Avadayappan, J.Paulraj Joseph and T.Subramanian Department of Mathematics Anna University:
More informationA CHARACTERIZATION FOR 2-SELF-CENTERED GRAPHS
Discussiones Mathematicae Graph Theory 38 (2018) 27 37 doi:10.7151/dmgt.1994 A CHARACTERIZATION FOR 2-SELF-CENTERED GRAPHS Mohammad Hadi Shekarriz Madjid Mirzavaziri Department of Pure Mathematics Ferdowsi
More informationA Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
More informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationComponent connectivity of crossed cubes
Component connectivity of crossed cubes School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Abstract: Let G = (V, E) be a connected graph. A r-component
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationFault-Tolerant Metric Dimension of Graphs
Fault-Tolerant Metric Dimension of Graphs Carmen Hernando (a), Merce Mora (b), Peter J. Slater (c), David R. Wood (b) (a) Departament de Matemàtica Aplicada I Universitat Politècnica de Catalunya, Barcelona.
More informationBroadcast Chromatic Numbers of Graphs
Broadcast Chromatic Numbers of Graphs Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi Clemson University {goddard,shedet,hedet}@cs.clemson.edu John M. Harris, Douglas F. Rall Furman University
More informationWORM COLORINGS. Wayne Goddard. Dept of Mathematical Sciences, Clemson University Kirsti Wash
1 2 Discussiones Mathematicae Graph Theory xx (xxxx) 1 14 3 4 5 6 7 8 9 10 11 12 13 WORM COLORINGS Wayne Goddard Dept of Mathematical Sciences, Clemson University e-mail: goddard@clemson.edu Kirsti Wash
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationEccentric Coloring of a Graph
Eccentric Coloring of a Graph Medha Itagi Huilgol 1 & Syed Asif Ulla S. 1 Journal of Mathematics Research; Vol. 7, No. 1; 2015 ISSN 1916-9795 E-ISSN 1916-909 Published by Canadian Center of Science and
More informationSection 8.2 Graph Terminology. Undirected Graphs. Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v.
Section 8.2 Graph Terminology Undirected Graphs Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v. The edge e connects u and v. The vertices u and v are
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
More informationarxiv: v4 [math.co] 4 Apr 2011
Upper-critical graphs (complete k-partite graphs) José Antonio Martín H. Faculty of Computer Science, Complutense University of Madrid, Spain arxiv:1011.4124v4 [math.co] 4 Apr 2011 Abstract This work introduces
More informationTHE THICKNESS OF THE COMPLETE MULTIPARTITE GRAPHS AND THE JOIN OF GRAPHS
THE THICKNESS OF THE COMPLETE MULTIPARTITE GRAPHS AND THE JOIN OF GRAPHS YICHAO CHEN AND YAN YANG Abstract. The thickness of a graph is the minimum number of planar s- panning subgraphs into which the
More informationCollapsible biclaw-free graphs
Collapsible biclaw-free graphs Hong-Jian Lai, Xiangjuan Yao February 24, 2006 Abstract A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected
More informationThe Dual Neighborhood Number of a Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 47, 2327-2334 The Dual Neighborhood Number of a Graph B. Chaluvaraju 1, V. Lokesha 2 and C. Nandeesh Kumar 1 1 Department of Mathematics Central College
More informationTriple Connected Complementary Tree Domination Number Of A Graph V. Murugan et al.,
International Journal of Power Control Signal and Computation (IJPCSC) Vol.5 No. 2,2013-Pp:48-57 gopalax journals,singapore ISSN:0976-268X Paper Received :04-03-2013 Paper Published:14-04-2013 Paper Reviewed
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationStrong Triple Connected Domination Number of a Graph
Strong Triple Connected Domination Number of a Graph 1, G. Mahadevan, 2, V. G. Bhagavathi Ammal, 3, Selvam Avadayappan, 4, T. Subramanian 1,4 Dept. of Mathematics, Anna University : Tirunelveli Region,
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationarxiv: v1 [math.co] 13 Aug 2017
Strong geodetic problem in grid like architectures arxiv:170803869v1 [mathco] 13 Aug 017 Sandi Klavžar a,b,c April 11, 018 Paul Manuel d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia
More informationDivisor cordial labeling in context of ring sum of graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (2017), 23-31. ISSN Print : 2249-3328 ISSN Online : 2319-5215 Divisor cordial labeling in context of ring sum of graphs G. V. Ghodasara
More informationDepartment of Mathematical Sciences University of Nevada, Las Vegas Las Vegas, NV
ON P -DEGREE OF GRAPHS EBRAHIM SALEHI Department of Mathematical Sciences University of Nevada, Las Vegas Las Vegas, NV 895-00 ebrahim.salehi@unlv.edu Abstract. It is known that there is not any non-trivial
More informationDOMINATION IN SOME CLASSES OF DITREES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 20-4874, ISSN (o) 20-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 6(2016), 157-167 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationGEODETIC DOMINATION IN GRAPHS
GEODETIC DOMINATION IN GRAPHS H. Escuadro 1, R. Gera 2, A. Hansberg, N. Jafari Rad 4, and L. Volkmann 1 Department of Mathematics, Juniata College Huntingdon, PA 16652; escuadro@juniata.edu 2 Department
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationGraph Theory Day Four
Graph Theory Day Four February 8, 018 1 Connected Recall from last class, we discussed methods for proving a graph was connected. Our two methods were 1) Based on the definition, given any u, v V(G), there
More informationSuper Connectivity of Line Graphs and Digraphs
Acta Mathematicae Applicatae Sinica, English Series Vol. 22, No. 1 (2006) 43 48 Super Connectivity of Line Graphs and Digraphs Min Lü 1, Jun-Ming Xu 2 1 Department of Computer Science and Technology, University
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationON A WEAKER VERSION OF SUM LABELING OF GRAPHS
ON A WEAKER VERSION OF SUM LABELING OF GRAPHS IMRAN JAVAID, FARIHA KHALID, ALI AHMAD and M. IMRAN Communicated by the former editorial board In this paper, we introduce super weak sum labeling and weak
More informationEDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS. Jordan Journal of Mathematics and Statistics (JJMS) 8(2), 2015, pp I.
EDGE MAXIMAL GRAPHS CONTAINING NO SPECIFIC WHEELS M.S.A. BATAINEH (1), M.M.M. JARADAT (2) AND A.M.M. JARADAT (3) A. Let k 4 be a positive integer. Let G(n; W k ) denote the class of graphs on n vertices
More informationOn the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs Volume 4 Issue 1 Article 3 017 On the Graceful Cartesian Product of Alpha-Trees Christian Barrientos Clayton State University, chr_barrientos@yahoo.com Sarah Minion Clayton
More informationDISTRIBUTIVE LATTICES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 317-325 DOI: 10.7251/BIMVI1702317R Former BULLETIN
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationSmarandache Directionally n-signed Graphs A Survey
International J.Math. Combin. Vol.2(2013), 34-43 Smarandache Directionally n-signed Graphs A Survey P.Siva Kota Reddy (Department of Mathematics, Acharya Institute of Technology, Soladevanahalli, Bangalore-560
More informationSome Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationEfficient Triple Connected Domination Number of a Graph
International Journal of Computational Engineering Research Vol, 03 Issue, 6 Efficient Triple Connected Domination Number of a Graph G. Mahadevan 1 N. Ramesh 2 Selvam Avadayappan 3 T. Subramanian 4 1 Dept.
More informationThe Game Chromatic Number of Some Classes of Graphs
The Game Chromatic Number of Some Classes of Graphs Casper Joseph Destacamento 1, Andre Dominic Rodriguez 1 and Leonor Aquino-Ruivivar 1,* 1 Mathematics Department, De La Salle University *leonorruivivar@dlsueduph
More informationGraceful Labeling for Cycle of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs
More informationRestricted edge connectivity and restricted connectivity of graphs
Restricted edge connectivity and restricted connectivity of graphs Litao Guo School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Xiaofeng Guo
More informationVertex Odd Divisor Cordial Labeling for Vertex Switching of Special Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 555 5538 Research India Publications http://www.ripublication.com/gjpam.htm Vertex Odd Divisor Cordial Labeling
More informationStrong geodetic problem in grid like architectures
Strong geodetic problem in grid like architectures Sandi Klavžar a,b,c Paul Manuel d January 9, 018 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi b Faculty
More informationOuter-2-independent domination in graphs
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 126, No. 1, February 2016, pp. 11 20. c Indian Academy of Sciences Outer-2-independent domination in graphs MARCIN KRZYWKOWSKI 1,2,, DOOST ALI MOJDEH 3 and MARYEM
More informationarxiv: v1 [math.co] 7 Dec 2018
SEQUENTIALLY EMBEDDABLE GRAPHS JACKSON AUTRY AND CHRISTOPHER O NEILL arxiv:1812.02904v1 [math.co] 7 Dec 2018 Abstract. We call a (not necessarily planar) embedding of a graph G in the plane sequential
More informationGraceful and odd graceful labeling of graphs
International Journal of Mathematics and Soft Computing Vol.6, No.2. (2016), 13-19. ISSN Print : 2249 3328 ISSN Online: 2319 5215 Graceful and odd graceful labeling of graphs Department of Mathematics
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
More informationEquitable Colouring of Certain Double Vertex Graphs
Volume 118 No. 23 2018, 147-154 ISSN: 1314-3395 (on-line version) url: http://acadpubl.eu/hub ijpam.eu Equitable Colouring of Certain Double Vertex Graphs Venugopal P 1, Padmapriya N 2, Thilshath A 3 1,2,3
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationInternational Journal of Mathematical Archive-7(9), 2016, Available online through ISSN
International Journal of Mathematical Archive-7(9), 2016, 189-194 Available online through wwwijmainfo ISSN 2229 5046 TRIPLE CONNECTED COMPLEMENTARY ACYCLIC DOMINATION OF A GRAPH N SARADHA* 1, V SWAMINATHAN
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationSubdivisions of Graphs: A Generalization of Paths and Cycles
Subdivisions of Graphs: A Generalization of Paths and Cycles Ch. Sobhan Babu and Ajit A. Diwan Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076,
More information