Component Connectivity of Generalized Petersen Graphs
|
|
- Karen Dalton
- 5 years ago
- Views:
Transcription
1 March 11, 01 International Journal of Computer Mathematics FeHa To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized Petersen Graphs Daniela Ferrero and Sarah Hanusch Department of Mathematics, Texas State University, San Marcos, Texas, U.S.A. (Received 00 Month 01X; final version received 00 Month 01X) Let G be a simple non-complete graph of order n. The r-component edge connectivity of G denoted as λ r(g) is the minimum number of edges that must be removed from G in order to obtain a graph with (at least) r connected components. The concept of r-component edge connectivity generalizes that of edge connectivity by taking into account the number of components of the resulting graph. In this paper we establish bounds of the r component edge connectivity of an important family of interconnection network models, the generalized Petersen graphs. Our investigation into this problem led us to solve another open problem: determining the girth of each generalized Petersen graph. AMS Classification: 05C40, 05C8, 05C75. Keywords: connectivity; edge connectivity; girth; component connectivity; Generalized Petersen Graphs 1. Introduction Let G be a simple non-complete graph of order n. An r-component cut of G is a set of vertices whose removal yields a graph with at least r connected components. The r-component connectivity of G denoted as κ r (G) is the minimum cardinality of an r- component cut. That is, κ r (G) is the minimum number of vertices that must be removed from G in order to obtain a graph with at least r connected components. Therefore, κ (G) = κ(g), the connectivity of G. Notice that κ r (G) is defined as the minimum number of vertices that must be removed from G in order to obtain a graph with at least r connected components, since for some graphs G it is not possible to obtain a graph with exactly r connected components by removing vertices. This concept was originally introduced by Sampathkumar [] and has been recently studied for hypercubes by Hsu et al. in []. An r-component edge cut of G is a set of edges whose removal yields a graph with r connected components. The r-component edge connectivity of G denoted as λ r (G) is the minimum cardinality of an r-component edge cut. That is, λ r (G) is the minimum number of edges that must be removed from G in order to obtain a graph with r connected components. Notice that λ (G) = λ(g), the edge connectivity of G. Also, notice that the minimum number of edges that must be removed from G in order to obtain a graph with at least r connected components coincides with the minimum number of edges that must be removed from G in order to obtain a graph with exactly r connected components. The concept of r-component edge connectivity was introduced by Sampathkumar [] who called it general line connectivity. The following are some important inequalities regarding r-component connectivity and r-component edge connectivity of an arbitrary simple non-complete graph G of order n. First, λ r (G) λ r+1 (G) for r =,..., n 1. Also κ r (G) κ r+1 (G) for r =,..., n 1. dferrero@txstate.edu, sh1609@txstate.edu
2 March 11, 01 International Journal of Computer Mathematics FeHa Moreover, κ r (G) λ r (G) for r =,..., n 1. Proofs of these inequalities are found in []. In this paper we study κ r (G) and λ r (G) when G is a generalized Petersen Graph. Given integers n and k 1, the generalized Petersen graph GP (n, k) has n vertices labeled u 0, u 1,... u n 1, v 0, v 1,... v n 1. The vertices labeled u 0, u 1,... u n 1 are called outer vertices while those labeled v 0, v 1,... v n 1 are inner vertices. There are three types of edges in GP (n, k): i) edges connecting outer vertices in the form u i u (i+1) mod n for i = 0, 1,... n 1; ii) edges connecting inner vertices in the form v i v (i+k) mod n for i = 0, 1,... n 1; and iii) spokes, or edges connecting an outer vertex with an inner one, in the form u i v i for i = 0, 1,..., n 1 for i = 0, 1,... n 1. Since k is only used within the modular arithmetic, k is restricted to 1 k < n without loss of generality. From the definition of generalized Petersen graphs it follows that GP (n, k) = GP (n, n k). Moreover, in some cases it is possible to find integers l, other than k and n k, such that GP (n, k) = GP (n, l). The following result from [5] specifies the isomorphism class of GP (n, k). Theorem 1.1. Let n be an integer, n 5. Let k and l be integers relatively prime to n satisfying k, l n. If GP (n, k) = GP (n, l), then either l = ±k mod n or kl = ±1 mod n. From this point use the smallest value of k in the isomorphism class of GP (n, k). As a consequence, we can always restrict k to values between 1 and n. Furthermore, if n is even, then n is an integer and is not relatively prime to n. Thus for minimal k, we can conclude 1 k < n. In order to study the r-component edge connectivity of generalized Petersen graphs we use the girth of a graph. Let G be a simple graph with at least one cycle, then the girth of G, denoted as g(g), is defined as the minimum among the lengths of all cycles in G. A shortest cycle is a cycle of minimum length. Some bounds for the girth of a generalized Petersen graph were presented in [4]. In this paper we establish the exact value of g(g) for every generalized Petersen graph G. We refer the reader to [1] for background concepts in graph theory not defined in this Introduction.. Girth In this section we will establish the exact value of the girth of a generalized Petersen graph GP (n, k) for any integers n and k 1. We begin with two special cases when n = and n = 4. First, note that for an arbitrary graph G, the trivial lower bound for the girth is g(g). The graph GP (, 1) = GP (, ), clearly has girth, as seen in Figure 1(a). We will prove later that this is the only graph to have girth. In the n = 4 case, GP (4, 1) = GP (4, ) has girth 4, as seen in Figure 1(b). Any cycle must contain an even number of spokes, and no two spokes are directly adjacent. If a cycle of GP (4, 1) has no spokes then it is either u 0, u 1, u, u, u 0 or v 0, v 1, v, v, v 0, in both cases of length 4. If a cycle contains two spokes, then if must contain at least two other edges or the spokes would be adjacent. Thus any such cycle had length greater than or equal to 4. The following theorem is a result from [4] which provides an upper bound for the girth of GP (n, k): Theorem.1. [4] For every n 5, 1 < k < n, and k relatively prime to n, the girth, g(gp (n, k)) min{8, k + }. In the study of cycles in generalized Petersen graphs we define different patterns.
3 March 11, 01 International Journal of Computer Mathematics FeHa (a) GP (, 1), with g(g) = (b) GP (4, 1), with g(g) = 4 Figure 1. The Generalized Petersen Graphs of small order. (a) The wedge cycle in GP (10, ) (b) The figure eight cycle in GP (10, ) Figure. Two different common cycles: the wedge cycle and the figure eight cycle. A wedge cycle, as seen in Figure (a), has the form u i, u i+1,..., u i+k, v i+k, v i, u i. It contains exactly one inner edge, two spokes and the outer edges connecting those spokes. A figure eight cycle, as seen in Figure (b), has the form u i, u i+1, v i+1, v i+k+1, u i+k+1, u i+k, v i+k, v i, u i. This is the shortest cycle that contains four spokes, and can be found in any generalized Petersen graph. The upperbound established in Theorem.1 is established because wedge cycles and figure eight cycles are found in every generalized Petersen Graph. Lemma.. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If g(gp (n, k)) 8, there is a shortest cycle in GP (n, k) that contains exactly two spokes. If g(gp (n, k)) = 8, there is a shortest cycle that contains exactly four spokes. Proof. Since spokes are the only edges joining outer vertices with inner ones, if a cycle contains spokes, it must contain an even number of them. Furthermore, since no two spokes are incident with the same vertex, for each spoke there must be at least one additional edge in the cycle. Therefore, any cycle with five or more spokes must have length greater than or equal to 10. But, since g(gp (n, k)) 8 for integers n 5 and 1 k < n, all cycles of minimum length have at most four spokes. Furthermore, the only case in which there is a cycle of minimum length with four spokes is when the girth is 8.
4 March 11, 01 International Journal of Computer Mathematics FeHa Figure. The Petersen Graph, GP (5, ) Notice that a cycle that contains no spokes must exclusively have outer vertices or inner vertices, but cannot have both. Besides, since n is relative prime to k, any cycle in GP (n, k) which contains no spokes must be of length n. However, since we assume k to be the minimal in the isomorphism class, k < n. Since < n for n > 6, we get that k + < n + n = n. Since the girth of GP (n, k) is less than or equal to k + for all integers n 5 and 1 k < n, it is impossible for a cycle of minimum length to have length n if n > 6. Still, since we assuming n 5 we still need to analyze the cases n = 5 and n = 6. Calculating the cases, we conclude that only the graph GP (5, ) has a cycle of minimal length n that contains no spokes. Furthermore, note that GP (5, ) has cycles of minimal length 5 with two spokes, such as u 0, u 1, v 1, v 4, u 4, u 0, see Figure. In conclusion, in a graph GP (n, k) where n 5 and 1 k < n every cycle of minimum length must have two or four spokes, except in the graph GP (5, ). In the case GP (5, ) there are cycles of minimal length which contain two spokes. Furthermore, the only case in which there is a cycle of minimum length with four spokes is when the girth is 8. Lemma.. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. Then, g(gp (n, k)) 4. Proof. It suffices to show g(gp (n, k)). If there was a cycle of length three, from Lemma. it would contain exactly two spokes. Since no two spokes are incident with the same vertex, the length of a cycle with two spokes must be at least four, and this is a contradiction. Lemma.4. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. Then, g(gp (n, k)) = 4 if and only if k = 1. Proof. Assume g(gp (n, k)) = 4. By Lemma. there exists a shortest cycle C that contains exactly two spokes. However, since the cycle has length four, the other two edges must both be incident with each spoke. Therefore the cycle is a wedge cycle with the form u i, u i+1, v i+1, v i, u i. However, since v i is only adjacent to v i+k, v i k and u i, for v i to be adjacent to v i+1 it means k = 1 or k = n 1. Since k is assumed minimal, k = 1. Conversely, if k = 1, then GP (n, 1) has a cycle u i, u i+1, v i+1, v i, u i, and since by Lemma. there are no cycles of length three, then g(gp (n, k)) = 4. Lemma.5. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. Then, g(gp (n, k)) = 5 if and only if k =. Proof. Assume g(gp (n, k)) = 5. By Lemma. there is a shortest cycle C that contains two spokes, say u i v i and u j v j for some integers i, j, 0 i, j n 1. The remaining edges
5 March 11, 01 International Journal of Computer Mathematics FeHa in C connect either two outer or two inner vertices. In the first case, C is a wedge cycle with u i, v i, v j=i+k, u j=i±, u i±1, u i, which clearly indicates that k = by minimality of k. In the second case, C will include the path u i, v i, v i+k, v j=i+k, u j=i±1, u i and as a consequence, i + k = i ± 1 mod n, so k = ±1 mod n. However, this means that and k are in the same isomorphism class, and the minimality of k implies k =. Conversely, observe that by construction GP (n, ) contains a wedge cycle of length 5. Then g(gp (n, )) 5. By Lemma. and Lemma.4 GP (n, ) does not contain cycles of length or 4, so we conclude g(gp (n, k)) = 5. Lemma.6. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. Then, g(gp (n, k)) = 6 if and only if k = or n = k +. Proof. Assume g(gp (n, k)) = 6. By Lemma. there is a shortest cycle C that contains two spokes. Therefore, there are three cases for C depending on whether the remaining four edges connect inner vertices or outer vertices: Case (i): There are three edges connecting outer vertices and one edge connecting inner vertices. In this case, C has the form of a wedge cycle. As a result k = ± mod n, but by the minimality of k, we conclude that k =. Case (ii): There are two edges connecting outer vertices and two edges connecting inner vertices. In this case, C has the form u i, v i, v i+k, v j=i+k, u j=i±, u i±1, u i, where in u j=i± and u i±1 both are either additions or subtractions. However, this means that k = ± mod n. Since k < n implies that n > k. This implies that k cannot equal mod n. Therefore, the only possibility is that n = k +. Case (iii): There are one edge connecting outer vertices and three edges connecting inner vertices. In this case C has the form u i, v i, v i+k, v i+k, v j=i+k, u j=i±1, u i. From i + k = i ± 1 mod n we can conclude that k = ±1 mod n. This means and k are the in same isomorphism class, so by the minimality of k we must conclude that k. However, if k <, then the girth is less than 6 which contradicts the hypothesis. To prove the converse, we use the following two cases depending on k: Case (i): If k =, then we can construct a wedge cycle of length 6, which means g(gp (n, k)) 6. Furthermore, by Lemmas.,.4 and.5 GP (n, k) does not contain cycles of length, 4, or 5, so we conclude g(gp (n, k)) = 6. Case (ii): If n = k +, then GP (n, k) contains a cycle of length 6 in the form u i, v i, v i+k, v i+k, u i+k=i+(n ), u i+(n 1), u i, see Figure 4(c). This construction means that g(gp (n, k)) 6. Again, by Lemmas.,.4 and.5 we know GP (n, k) can contain cycles of length, 4, or 5 only if k = 1 or k =. If k = 1, then n = 4 which contradicts the hypothesis n 5. If k =, then n = 6 which contradicts the hypothesis that n and k are relatively prime. Therefore, g(gp (n, k)) = 6. Lemma.7. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. Then, g(gp (n, k)) = 7 if and only if k = 4 or n = k + for k 4 or n = k ± for k 5. Proof. Assume g(gp (n, k)) = 7. By Lemma. there is a shortest cycle C that contains exactly two spokes. We consider four cases depending on the remaining five edges in C: Case (i): There are four edges connecting outer vertices and one edge connecting inner vertices. In this case C has the form of a wedge cycle. Therefore, k = ±4, so by the minimality of k we see that k = 4 in this case. Case (ii): There are three edges connecting outer vertices and two edges connecting inner vertices. In this case C has the form u i, v i, v i+k, v j=i+k, u j=i±, u i±, u i±1. Therefore, k = ± mod n. However, since n > k by the minimality of k we know k mod n. Therefore, n = k +.
6 March 11, 01 International Journal of Computer Mathematics FeHa Case (iii): There are two edges connecting outer vertices and three edges connecting inner vertices. In this case C has the form u i, v i, v i+k, v i+k, v j=i+k, u j=i±, u i±1, u i. Therefore, k = ± mod n. Since n > k we know that k < n, and thus n = k ±. Case (iv): There is one edge connecting outer vertices and four edges connecting inner vertices. In this case C has the form u i, v i, v i+k, v i+k, v i+k, v j=i+4k u j=i±1, u i. This means that 4k = ±1 mod n. However, this means 4 and k are in the same isomorphism class, so k 4 by the minimality of k. But, k / {1,, } because of Lemmas.,.4,.5, and.6. To prove the converse, we use the following three cases depending on k: Case (i): If k = 4 we know that GP (n, 4) the wedge cycle has length 7, so we may conclude g(gp (n, k)) 7. Furthermore, by Lemmas.,.4, and.5 GP (n, 4) has no cycles of length, 4 or 5. In addition, by Lemma.6 GP (n, 4) can have a cycle of length 6 only if n = k + However, if k = 4 then n = k + = 10 and since 4 and 10 are not relatively prime, that case cannot happen under the hypothesis. Thus, we conclude that g(gp (n, k)) = 7 in this case. Case (ii): If n = k + for k 4, then GP (n, k) has a cycle of length 7 of the form u i, v i, v i+k, v j=i+k, u j=i, u i, u i 1, u i (see Figure 4(d)), so we may conclude g(gp (n, k)) 7. Furthermore, because k 4 and n k + by Lemmas.,.4,.5, and.6 there are no cycles of length, 4, 5, or 6. Thus, we conclude that g(gp (n, k)) = 7 in this case. Case (iii): If n = k ± for k 5, then GP (n, k) has a cycle of length 7 of the form u i, v i, v i+k, v i+k, v j=i+k, u j=i±, u i±1, u i (see Figures 4(e) and 4(f)), so we may conclude g(gp (n, k)) 7. Since k 5, GP (n, k) contains no cycles of length, 4 or 5. In addition, if n = k + and n = k +, then the only solution for k is k = 0, which contradicts the condition that k 5. If n = k + and n = k, then the solution of the equation is k = 4, which also contradicts that k 5. Therefore, it is not possible for GP (n, k) to have a cycle of length 6, and we conclude that g(gp (n, k)) = 7 in this case. Theorem.8. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. 4, if k = 1 5, if k = g(gp (n, k)) = 6, if n = k +, or k = 7, if n = k + for k 4, or n = k ± for k 5, or k = 4 8, otherwise Proof. By Theorem.1 we know g(gp (n, k)) 8. By Lemmas.,.4,.5,.6 and.7 we know exactly when the girth is 4, 5, 6, and 7. Therefore, in all additional cases the girth must be 8.. Edge component connectivity In this section we provide lower and upper bounds for the r-component edge connectivity of a generalized Petersen graphs. The lower bounds, however, apply to any connected graph. Theorem.1. Let G be a connected graph with order n and edge connectivity λ(g). For
7 March 11, 01 International Journal of Computer Mathematics FeHa (a) The wedge cycle in GP (10, ) (b) A figure eight cycle in GP (0, 7) (c) A shortest cycle when n = k +, as found in GP (8, ) (d) A shortest cycle when n = k +, as found in GP (1, 5) (e) A shortest cycle when n = k +, as found in GP (, 7) (f) A shortest cycle when n = k, as found in GP (1, 11) Figure 4. These figures show the six possibilities for a shortest cycle. every integer r =,..., n, let λ r (G) be the r-component edge connectivity of G. Then, rλ(g) λ r (G) Proof. Notice that from the definition of -component edge connectivity, λ(g) = λ (G), so it is equivalent to prove λ r (G). Let S r be a minimal r-component edge rλ(g) cut. Then, G S r contains exactly r components, say C 1, C,...,C r. Notice that for each i =,..., r, the number of edges in S r incident to vertices in C i must be at least λ (G)
8 March 11, 01 International Journal of Computer Mathematics FeHa Figure 5. Beginning the (de)construction of GP (0, ). The wedge cycle, C 0, is bold and magenta. The cycle has minimum length (otherwise G could have been disconnected by deleting less than λ (G) edges, which is a contradiction). However, each edge in S r will be incident with vertices in two different components, so we can conclude that S r = λ r (G). rλ(g) Since λ(gp (n, k)) =, we can derive the following corollary: Corollary.. Let n and k be integers such that n and k 1. Then, for every integer r =,..., n, λ r (GP (n, k)) r Next we provide upper bounds for the r-component edge connectivity of generalized Petersen graphs. The bounds depend on the structure of the shortest cycles, so each of the six types of shortest cycles have their own theorem. All of the proofs are by construction and involve careful analysis of all the cycles of shortest length and how different copies of these cycles overlap. In each of the piecewise functions that follow, each piece of the function models a different way that the copies interact with one another. Theorem.. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If g(gp (n, k)) = k +, then for every integer r =,..., n, λ r (GP (n, k)) M 1 (n, k, r), where r 1 r k + r 1 r k 1 k + 4 r min {4k, n 4k} M 1 (n, k, r) = r k 1 r 4k 1 4k + 1 r n 4k r n + k 1 (r n + 4k) n 4k + 1 r n k 1 n + r n k r n Proof. To prove this result, for each r =,..., n we will construct S r, an r-component edge cut for GP (n, k) with cardinality M 1 (n, k, r). Since λ r (GP (n, k)) is defined as the minimum cardinality of an r-component edge cut of GP (n, k), it follows immediately that λ r (GP (n, k)) M 1 (n, k, r). Since g(gp (n, k)) = k +, for every i = 0,..., n 1 the family of wedge cycles is the family of shortest cycles. Let C i be the wedge cycle starting at u i, C i = u i, u i+1,..., u i+k, v i+k, v i, u i, where all indices are considered modulo n. We will describe the construction process of each S r using the cycles described above. Without loss of generality, let us assume we start the process with the cycle C 0 =
9 March 11, 01 International Journal of Computer Mathematics FeHa Figure 6. GP (0, ) S which has two components. Figure 7. GP (0, ) S k+ with k + = 6 components. The only vertex of C 0 in the large component is v 0, which is incident to a bridge that is shown in bold. u 0, u 1,... u k, v k, v 0, u 0, as seen in Figure 5. Notice that for every pair of integers n and k such that n 5 and k 1, λ (GP (n, k)) =. Then, the set of all edges incident to any given vertex form a minimal edge cut for GP (n, k). In particular, removing the edges u 0 u n 1, u 0 v 0 and u 0 u 1 isolates u 0. Then, S = {u 0 u n 1, u 0 v 0, u 0 u 1 } is a -component edge cut, as seen in Figure 6. We proceed constructing S k by adding edges to S k 1 for k =,..., n For every integer r =,..., k + we can build an r-component edge cut S r by adding two edges to the (r 1)-component edge cut S r 1. Indeed, isolating the remaining vertices of C 0 in the order specified in the description of C 0 above, guarantees that the removal of exactly two edges suffices to isolate the remaining vertices u 1, u,..., u k, v k. Therefore, for each integer r =,... k+ the set S r constructed has cardinality +(r ) = r 1, so M 1 (n, k, r) = r 1 if r k +. The vertex v 0 has not been isolated yet, as seen in Figure 7, and it is attached to the large component of the graph only by a bridge. Therefore, S k+4 can be obtained by adding one single edge to S k+, as in Figure 8. As a consequence, M 1 (n, k, k+4) = r. Notice that r = r 1 k+4 k 1 = r 1 r k 1 when r = k + 4. Once all vertices of C 0 have been isolated, we proceed isolating the vertices of C 1. However, vertices u 1, u,..., u k have already been isolated by the previous step. Therefore, only three vertices in C 1 remain incident to the large component: u k+1, v k+1 and v 1, as seen in Figure 8. As we proceed in that order, two edges must be removed to isolate u k+1, two edges must be removed to isolate v k+1 and one edge to isolate v 1. Thus, to create an additional component, we must increase the number of removed edges by two, except for every third component, where only one edge suffices. Therefore, the function M 1 changes when r k + 4. After the first k + 4 components, every third component will only be connected by a bridge. This means that M 1 (n, k, r) =
10 March 11, 01 International Journal of Computer Mathematics FeHa Figure 8. This illustrates the transition from the first line to the second line of M 1. GP (0, ) S k+4 contains k + 4 = 7 components. Every vertex of C 0 is isolated, and C 1 is shown in bold. Figure 9. GP (7, ) where n k < k, i.e. 7 4 < 4. Note that after we isolate v, the vertex v 5 is connected only by a bridge. r r k 4 = r 1 r k 1. Furthermore, if n 4k, then each cycle C,..., C k 1 continues this pattern of having three vertices that are not isolated. When we isolate the vertices on all of these cycles C 0,..., C k 1, we have k + + (k 1) = 4k isolated vertices, so M 1 (n, k, r) = r 1 r k 1 for r [k + 4, 4k] when n 4k. However, when n < 4k or equivalently, when n k < k (see Figure 9), we have that v n k is a vertex on C i for some i < k. When this occurs, the pattern changes and this piece of the function no longer applies. Therefore, the domain for this piece of the function is r [k + 4, min {4k, n 4k}]. Next we continue, with C k. Note, if n < 4k, then [4k + 1, n 4k] is the empty set, so we are only concerned with the case n 4k. When we consider C k, we observe that now u k, u k+1,..., u k 1 and v k have all been isolated by previous steps (see Figure 10). As such, the only two vertices connected to the large component are u k and v k. Furthermore, as we continue around the graph, the cycles C k+1, C k+,..., C n k all have exactly two vertices not isolated by previous steps. As such, two edges will need to be removed to isolate each u i and one edge to isolate each v i, which means M 1 (n, k, r) changes every other component. Since this change begins with the 4k + 1 component, which has (4k + 1) k 1 edges removed, we know M 1 (n, k, r) = r k 1 r 4k 1 for r [4k + 1, n 4k]. When we have exactly r = n 4k components, this means the vertices u 0, u 1,..., u n k, v 0, v 1,..., v n k 1 have been completely isolated and the vertices u n k+1, u n k+,..., u n 1, v n k, v n k+1,..., v n 1 are still connected (see Figure 11). At this point M 1 (n, k, r = n 4k) = r k 1 n 4k 4k 1 = r n + k. When we isolate v n k we remove the edge v n k v n k, which makes M 1 (n, k, n 4k +
11 March 11, 01 International Journal of Computer Mathematics FeHa Figure 10. GP (0, ) S 4k+1 with 4k + 1 = 1 components. The cycle C k is shown in bold. Only two vertices of C k are in the large connected component. Figure 11. This illustrates the third line of M 1. GP (0, ) S n 4k+1 with n 4k + 1 = 9 components. The cycle C n k is in bold. Figure 1. The transition from the third line to the fourth line of M 1. GP (0, ) S n 4k+ with n 4k+ = 1 components. Note the bridge connecting v n k=17 to the large component, which is emphasized with bold and in cyan. 1) = r n + k 1. However, since v n k v 0 was removed in the first step, this means v n k can also be isolated by only removing one additional edge (namely, u n k v n k ), see Figures 1 and 1. This pattern repeats for the next k 1 cycles, where we isolate u n k+i by removing two edges, we isolate v n k+i by removing one edge, and we isolate v n k+i by removing one edge, where i [0, k 1]. Thus, M 1 (n, k, r) = r n + k 1 (r n + 4k), and increases by 1, two out of every three components for r [n 4k + 1, n k 1]. After all of these vertices have been isolated, the graph has the form of n k isolated vertices and a path of length k, as seen in Figure 14. Therefore, at this point we only need to remove one edge in order to isolate each vertex. As such, M 1 (n, k, r) will increase
12 March 11, 01 International Journal of Computer Mathematics FeHa Figure 1. GP (0, ) S n 4k+4 with n 4k + 4 = 1 components. The bridge connecting v n k=17 to the large component has been removed. Figure 14. GP (0, ) nearly disconnected. The only vertices that remain connected form a path of exactly k vertices, which is illustrated in bold. by one every time the number of components increases by one. Theorem.4. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If g(gp (n, k)) = 8, then for every integer r =,..., n, we conclude λ r (GP (n, k)) M (n, k, r), where r 1 r 8 r r r min {4k 6, n 4k} r k + 1 r = 4k 5 < n 4k M (n, k, r) = r k + 1 r 4k+5 4k 4 r 4k + 1 r k 1 r 4k 1 4k + r n 4k r n + k 1 (r n + 4k 1) n 4k + 1 r n k n + r n k + 1 r n Proof. This proof is very similar to the previous one. Let G = GP (n, k), where n and k satisfy all of the conditions in the hypothesis. The function M (n, k, r) arises from creating an r-component edge cut, S r, by isolating vertices along repeated copies of shortest cycles. Since g(gp (n, k)) = 8, the figure eight cycles, C i = u i, u i+1, v i+1, v i+k+1, u i+k+1, u i+k, v i+k, v i, u i, are cycles of shortest length, see Figure 15. An important observation is that C i C i+1 contains four vertices {u i+1, v i+1, v i+k+1, u i+k+1 }. As before, S = {u 0 u 1, u 0 v 0, u 0 u n 1 }. To construct, S through S 8 we add the edges incident with each vertex of C 0, one at a time. As such S = S {u 1 u, u 1 v 1 }, S 4 = S {v 1 v k+1, v 1 v n k+1 } and S 8 = S 7 {v k v k, v 0 v k }. Because of this M (n, k, r) = S r = r 1
13 March 11, 01 International Journal of Computer Mathematics FeHa Figure 15. GP (9, 6) which has girth 8. The cycle C 0 is shown in bold and green. Figure 16. GP (9, 6) S 9 which has girth 8. The cycle C 1 is shown in bold and red. for r 8. In G S 8, every vertex of C 0 is isolated, except the final vertex v 0. This vertex is connected by a bridge to G S 8, so S 9 = S 8 {v 0, v n k }. Since C 1 overlaps with C 0, in G S 9 the vertices u 1, v 1, v k+1, u k+1 are isolated, see Figure 16. However, the vertices u, v, v k+, u k+ are still connected in the large component of G S 9. Isolating the first three vertices requires an additional two edges in S 10, S 11, and S 1. However, isolating u k+ will only require one additional edge, because this reaches the end of the cycle C 1. The pattern of adding one additional edge, then three instances of adding two additional edges repeats from S 9 until S 4(k )+1. This is because the pattern corresponds to the four vertices which remain connected in C 1, C,..., C k. As such, M (n, k, r) = S r = r r 9 4 for 9 r 4k 7. G S 4k 7 consists of the isolated vertices u 0, u 1,..., u k, v 0, v 1,..., v k, u k, u k+1,..., u k, v k, v k+1,..., v k, and one large connected component. Continuing along the pattern of isolating vertices in shortest cycles, we consider u k the first vertex in C k. Isolating u k requires two edges, so S 4k 6 = S 4k 7 {u k u k 1, u k v k }, which gives the second line of the piecewise function. However, now there is a slight change in the pattern. The vertex u k 1 is now connected by only a bridge because the edges u k 1 u k and u k u k 1 have previously been removed. Thus, S 4k 5 = S 4k 6 {u k 1 v k 1 }, and M (n, k, r = 4k 5) = r 4k = r k + 1. However, now the vertices of C k and C k must be isolated. Since, three vertices of C k are in the large connected component of G S 4k 5, so S 4k 4 = r k + 1, S 4k = r k + 1 and S 4k = r k +. This pattern repeats with C k, so we can summarize this as M (n, k, r) = r k + 1 r k+5 for 4k 4 r 4k + 1. In G S 4k+1, six of the vertices of C k 1 are isolated, namely {u k 1, v k 1, u k, v k,
14 March 11, 01 International Journal of Computer Mathematics FeHa Figure 17. GP (9, 6) S 4k+1 which has girth 8. The cycle C k is shown in bold and blue. Figure 18. GP (9, 6) S n 4k+ which has girth 8. The cycle C 10=n k 1 is shown in bold. In addition, the bridge u =n k v =n k is shown in bold and in purple. u k 1, v k 1 }. This leaves only u k and v k in the large connected component, see Figure 17. Two edges must be added to S 4k+ and one edge to S 4k+ in order to isolate these vertices. The pattern of each C i containing two connected vertices continues through C n k. These cycles correspond to edge cuts S 4k+ through S n 4k, where edge cuts with an odd index gain one additional edge while edge cuts with an even index gain two additional edges. As such M (n, k, r) = r k r 4k 1. The last vertex of Cn k is connected by a bridge, so S n 4k+1 gains one edge v n k v n k. The pattern changes slightly in C n k 1. There are still two vertices of C n k 1 in the connected component of G S n 4k+1. Thus, S n 4k+ gains two edges u n k u n k+1, u n k v n k, and S n 4k+ gains one edge v n k v n k. However, the vertex v n k is now connected by a bridge (see Figure 18), because v n k v n k is in edge set S n 4k+, and v n k v 0 is in edge set S. The only remaining edge adjacent to v n k is u n k v n k. Thus, S n 4k+4 gains only one additional edge. This pattern continue through C n k, so M (n, k, r) = r n+k (r r + 4k 1) for n 4k +1 r n k. At this point G S n k is a path containing k + 1 vertices, see Figure 19. Each edge removal results in a new component, so M (n, k, r) = n + r, until all n vertices are isolated, which means n edges have been removed. Theorem.5. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If n = k +, then for every integer r =,..., n, λ r (GP (n, k)) M (n, k, r), where
15 March 11, 01 International Journal of Computer Mathematics FeHa Figure 19. GP (9, 6) S n k+1 which has girth 8. The path is shown in bold. Figure 0. GP (4, 11) which has girth 6, and 4 = One copy of the smallest cycle is bold and in red. r 1 r 6 r 7 r min 10, k 1 M (n, k, r) = r r r k 1 r k + 1 (r k + ) k r k + n + r n k = k + 4 r n = 4k + 4 Proof. In the hypothesis of this theorem, the shortest cycles in GP (n, k) are in the form C i = u i, u i+1, u i+, v i+, v i+k+, v i+k+ i, u i, as in Figure 0. We begin by isolating each vertex in C 0. It requires and edge cut of S = edges to isolate u 0, and an additional two edges to isolate each of u 1, u, v and v k +. As such, M (n, k, r) = r 1 for r 6. The final vertex of C 0 is v 0 and requires only one additional edge for the edge cut S 7, so M (n, k, 7) = r. The next copy of the cycle is C 1. The vertices u 1 and u are isolated in G S 7, so there are only four vertices in the connected component. The isolation of the first three of these vertices (u, v, v k+ ) require the addition of two edges to the edge cut, so M (n, k, r) = r for 7 r 10. The final vertex, v 1 is attached by a bridge so M (n, k, r) = r. Next, is C. In G S 10, u, v and u are isolated vertices. v k+4, v 4 and u 4 are connected. Therefore, S 11 gains two additional edges, S 1 gains two additional edges, and S 1 requires one additional edge. This pattern continues with C through C k. When C k is fully disconnected there are (k 4) = k 1 components. As such, M (n, k, r) = r r 11 for 11 r k 1.
16 March 11, 01 International Journal of Computer Mathematics FeHa Figure 1. GP (4, 11) S k 1 Figure. GP (5, 11) which has girth 7, and 5 = One copy of the shortest cycle is bold and in purple. In G S k 1 the vertices u 0, v 0, u 1, v 1,..., u k 1, v k 1 and v k+, v k+,..., v k 1 have already been isolated, as seen in Figure 1. As we continue and isolate u k, two additional edges must be removed, so S k = S k 1 {u k u k+1, u k v k }. In G S k, the vertex v k is connected by a bridge, so S k+1 = S k {v k v k }. In G S k+1, the vertex v k is also connected by a bridge, so S k+ = S k+1 {u k v k }. The resulting graph, G S k+ a single cycle remains, so isolating any vertex requires removing two additional edges. This section is summarized in M (n, k, r) = r k + 1 (r k+1) for k r k +. Since G S k+ is a path of length k +, only one edge needs to be removed to create an additional connected component. Thus, M (n, k, r) = n + r for k + 4 r n. Theorem.6. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If n = k +, then for every integer r =,..., n, λ r (GP (n, k)) M 4 (n, k, r), where r 1 r 7 r r r min {16, k } M 4 (n, k, r) = r 4 r r k r k + (r k + ) k 1 r k + 5 = n k 1 n + r n k r n Proof. In the hypothesis of this theorem, the shortest cycles in GP (n, k) have the form C i = u i, u i+1, u i+, u i+, v i+, v i+k+, v i+k+ i, u i, as seen in Figure. We begin by isolating each vertex in C 0. It requires and edge cut of S = edges to
17 March 11, 01 International Journal of Computer Mathematics FeHa Figure. GP (5, 11) S k isolate u 0, and two additional edges to isolate each of u 1, u, u, v and v k +. Thus, M 4 (n, k, r) = r 1 for r 7. The final vertex of C 0 is v 0 and its isolation requires only one additional edge in the edge cut S 8, so M 4 (n, k, 8) = r. The next copy of the cycle is C 1. The vertices u 1, u and u are isolated in G S 8, so only four vertices are in the connected component. The first three of these vertices (u 4, v 4, v k+4 ) require the removal of two additional edges to be isolated, so M 4 (n, k, r) = r for 8 r 11. The final vertex, v 1 is attached by a bridge so M 4 (n, k, 1) = r. We proceed similarly for the cycle C. The vertices u, u and u 4 are isolated in G S 1, so four vertices are in the connected component. The first three of these vertices (u 5, v 5, v k+5 ) require two additional edges, so M 4 (n, k, r) = r for 1 r 15. The final vertex, v is attached by a bridge so M 4 (n, k, 1) = r 4. We summarize the last two paragraphs in M 4 (n, k, r) = r r 8 4 for 8 r min 16, k. Next, is C. In G S 16, u, v, u 4 and u 5 are isolated vertices while v k+6, v 6 and u 6 are not. Therefore, S 17 gains two additional edges, S 18 gains two additional edges, and S 19 requires one additional edge. This pattern continues with C 4 through C k 4. When all vertices in C k 4 have been isolated there are (k 4 ) = k components. Therefore, M 4 (n, k, r) = r 4 r 16 for 17 r k. G S k has the vertices u 0, v 0, u 1, v 1,..., u k 1, v k 1 and v k+, v k+4,..., v k 1 already isolated, as seen in Figure. As we continue and isolate u k, two additional edges must be removed, so S k 1 = S k {u k u k+1, u k v k }. In G S k 1, the vertex v k is connected by a bridge, so S k = S k 1 {v k v k }. In G S k, the vertex v k is also connected by a bridge, so S k+1 = S k {u k v k }. This pattern repeats with u k+1, v k+1 and v k+1, so that the resulting graph, G S k+4 a single cycle remains, so isolating any vertex requires removing two additional edges. This section is summarized in M 4 (n, k, r) = r k+ (r k+) for k 1 r k + 5 = n k 1. G S k+5 is a path of length k +. As such, only one edge needs to be removed for each additional component. Thus, M (n, k, r) = n + r for k + 6 = n k r n. Theorem.7. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If n = k +, then for every integer r =,..., n, λ r (GP (n, k)) M 5 (n, k, r), where r 1 r 7 r r r min { 16, 9k 7 } M 5 (n, k, r) = r 4 r r 9k 7 r (k ) 9k 7 (r ) 9k 5 r 9k+7 9k+9 n + r r n
18 March 11, 01 International Journal of Computer Mathematics FeHa Figure 4. GP (5, 11) which has girth 7, and 5 = One copy of the smallest cycle is bold and in blue. Proof. Graphs satisfying the conditions in the hypothesis have girth 7 and all shortest cycles are in the form C i = u i, u i+1, u i+, v i+, v i+k+, v i+k+, v i, u i, as seen in Figure 4. Notice that GP (n, k) = GP (n, l) if l = n = k 1. Since GP (n, l) satisfies all of the conditions for the previous theorem, except the minimality of the isomorphism class, we will use the previous case as a guideline, and will often use l in our calculations to simplify the expressions. We begin by isolating the vertices of C 0. This is identical to the previous cases, so M 5 (n, k, r) = r 1 for r 7. Next, we will isolate the vertices of C k. This is because C 0 C k contains three vertices, whereas C 0 C 1 only contains two. In addition, C k corresponds to the next cycle in GP (n, l). As we proceed through C k we observe that in G S 7 the vertices v 0, v k+, v k+ are already isolated. Thus, only four vertices v k, u k, u k+1 and u k+ are in the connected component. It requires two additional edges for each edge cut, except the final vertex, so S r = M 5 (n, k, r) = k r 8 4 for 8 r 1. G S 1 has isolated the vertices v 0, v k and v k+ of C k. The vertices v k, u k, u k+1 and u k+ remain in the connected component, so the pattern continues with M 5 (n, k, r) = k r 8 4 for 8 r 16. Next we proceed to C k. In G S 16, four of the vertices of C k are isolated, u 0, v 0, v k and v k. The function changes here so that two vertices v k and u k are isolated by adding two new edges to each respective edge cut, and u k+1 gains only one additional edge. So, M 5 (n, k, r) = r 4 r 16 for 17 r 19. We continue along the cycles whose subindices are multiples of k, to C 4k k mod n. Since the vertices in C k were previously isolated and C k shares several vertices with C k, there are only three vertices to isolate in G S 19. This pattern continues until C mk where mk mod n. This condition is equivalent to m = k + 1. The pattern changes at C because at this point u, u 4 and v, each has exactly two incident edges, so it only take 4 edges instead of 5 to isolate them. When the vertices of the cycles C 0, C k, C k,..., C (m 1)k ( (k ) ) are all isolated, there are (m) = = 9k 7 connected components, where the (m) are vertices for each cycle, the comes from the extra vertices in C k and C k, the 4 comes from the extra vertices in C 0, and the 1 come from the connected component. Thus, M 5 (n, k, r) = r 4 r 16 for 17 r 9k 9. One valuable observation is that in GP (n, l), the cutoff would be l = ( ) k 1 = 9k 7 When the pattern changes at C, S 9k 5 gains two new edges, and S 9k and S 9k 1 gains one new edge per vertex, see Figure 5. This pattern continues for C k+. Thus, M 5 (n, k, r) = r (k ) 9k 7 (r ) for 9k 5 r 9k+7. At this point the only non-trivial connected component is a path. Thus, M 5 (n, k, r) = n + r for 9k+9 r n..
19 March 11, 01 International Journal of Computer Mathematics FeHa Figure 5. GP (5, 11) which has girth 7, and 5 = Figure 6. GP (1, 11) which has girth 7, and 5 = One copy of the shortest cycle is bold and in cyan. Theorem.8. Let n and k be two relatively prime integers, n 5, such that k = min{l : GP (n, l) = GP (n, k)}. If n = k, then for every integer r =,..., n, λ r (GP (n, k)) M 6 (n, k, r), where r 1 r 7 r r r min { 16, 9k 19 } M 6 (n, k, r) = r 4 r r 9k 19 r k 9 9k 17 (r ) 9k 17 r 9k 5 9k n + r r n Proof. Graphs satisfying the hypothesis of this theorem have girth 7, so the shortest cycles are in the form C i = u i, u i+1, u i+, v i+, v i+k, v i+k, v i, u i, as seen in Figure 6. If we were to invert GP (n, k) into its isomorphic partner GP (n, l) where l = n = k 5, then GP (n, l) satisfies all of the conditions for the previous case, except the minimality of the isomorphism class. We begin by isolating the vertices of C 0. This is identical to the previous cases, so M 6 (n, k, r) = r 1 for r 7. Next, we will isolate the vertices of C k. Again, this is because C 0 C k contains three vertices, whereas C 0 C 1 only contains two. As we proceed through C k we observe that in G S 7 the vertices v, v k, v k are already isolated. Thus, only four vertices v k+, u k, u k+1 and u k+ are in the connected component. It requires two additional edges for each edge cut, except the final vertex, so S r = M 6 (n, k, r) = k r 8 4 for 8 r 1. G S1 has isolated the vertices v, v k+ and v k of C k. The vertices v k+, u k, u k+1 and u k+ remain in the connected component, so the
20 March 11, 01 International Journal of Computer Mathematics FeHa Figure 7. GP (1, 11) S 9k 19 =40. This shows what happens at C n =8 pattern continues with M 6 (n, k, r) = k r 8 4 for 8 r 16. Next we proceed to C k mod n. In G S 16, four of the vertices of C are isolated, u, v, v k+ and v k+. The function changes here so that two vertices u and u 4 are isolated by adding two new edges to each respective edge cut, and v 4 gains only one additional edge. So, M 6 (n, k, r) = r 4 r 16 for 17 r 19. We continue along the cycles whose subindices are multiples of k, to C 4k k mod n. Since all vertices in C k were previously isolated and C k shares several vertices with C k+, there are only three vertices to isolate in G S 19. This pattern continues until C mk where mk mod n. This condition is equivalent to m = k 1. The pattern changes at C mk n mod n because at this point u n, u n 1 and v n 1 each has exactly two incident edges, so it only take 4 edges instead of 5 to isolate them. When the vertices ( of the) cycles C 0, C k, C k,..., C (m 1)k are all isolated, there are (m)++4+1 = (k ) 1 +7 = 9k 1 components, where the (m) are vertices for each cycle, the comes from the extra vertices in C k and C k, the 4 comes from the extra vertices in C 0, and the 1 come for 17 r 9k 19 from the connected component. Thus, M 6 (n, k, r) = r 4 r 16 When the pattern changes at C n, it changes so that S 9k 17. gains two new edges, and gains one new edge per vertex(see Figure 7. This pattern continues S 9k 15 and S 9k 1 for C k. Thus, M 6 (n, k, r) = r k 9 9k 17 (r ) for 9k 17 r 9k 5. At this point, the only non-trivial connected component is a path. Thus, M 6 (n, k, r) = n + r for 9k r n. 4. Conclusion and Further Research In this paper we present upper and lower bounds for the r component edge connectivity of generalized Petersen graphs. However, we left open the identification of the graphs where one of those bounds provide the exact value of the r-component edge connectivity. In the introduction we defined the edge and the vertex versions of the concept of component connectivity. In this paper we have only studied the r-component edge connectivity. It is also interesting to study the vertex r-component connectivity of generalized Petersen graphs. Generalized Petersen graphs are an interesting family of vertex-transitive and -regular graphs. It would be interesting to explore the extension of the results we found to other vertex-transitive graphs, or to other families of regular graphs. Finally, it would be interesting to study the notion of r-component connectivity with the additional condition that the order of the connected components must be the same,
21 March 11, 01 International Journal of Computer Mathematics FeHa or as close to each other as possible. This is a much hard problem, and a more relaxed and also interesting version of the problem would be to add the condition that the connected components cannot be trivial. That is, to combine the concepts of super connectivity and component connectivity. References [1] G. Chartrand, L. Lesniak and P. Zhang, Graphs & Digraphs,5th. Ed. Chapman and Hall/CRC (010). [] E. Sampathkumar, Connectivity of a graph-a generalization, J. Combin, Information System Sciences. 9 (1984), pp [] L. Hsu, E. Cheng, L. Lipták, J. Tan, C. Lin, and T. Ho, Component connectivity of the hypercubes, International Journal of Computer Mathematics 89 (01), pp [4] A. J. Sanford, Cycle spectra, automorphic uniqueness, and isomorphism classes of the Generalized Petersen graphs, Ph.D. diss., University of Mississippi, 005. [5] A. Steimle, and W. Staton, The isomorphism classes of the generalized Petersen graphs, Discrete Mathematics 09 (009), pp. 1-7.
Component 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 informationOn Super and Restricted Connectivity of Some Interconnection Networks
On Super and Restricted Connectivity of Some Interconnection Networks Jun-Ming Xu Jian-Wei Wang Wei-Wei Wang Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026,
More informationMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
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 informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationChapter 2. Splitting Operation and n-connected Matroids. 2.1 Introduction
Chapter 2 Splitting Operation and n-connected Matroids The splitting operation on an n-connected binary matroid may not yield an n-connected binary matroid. In this chapter, we provide a necessary and
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 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 informationA NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH
A NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH STEPHAN WAGNER Abstract. In a recent article by Bród and Skupień, sharp upper and lower bounds for the number of dominating sets in a tree were determined.
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
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 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 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 informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationPETAL GRAPHS. Vellore, INDIA
International Journal of Pure and Applied Mathematics Volume 75 No. 3 2012, 269-278 ISSN: 1311-8080 (printed version) url: http://www.ijpam.eu PA ijpam.eu PETAL GRAPHS V. Kolappan 1, R. Selva Kumar 2 1,2
More informationA study on the Primitive Holes of Certain Graphs
A study on the Primitive Holes of Certain Graphs Johan Kok arxiv:150304526v1 [mathco] 16 Mar 2015 Tshwane Metropolitan Police Department City of Tshwane, Republic of South Africa E-mail: kokkiek2@tshwanegovza
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 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 informationStar Decompositions of the Complete Split Graph
University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses
More informationDiscrete Mathematics. Elixir Dis. Math. 92 (2016)
38758 Available online at www.elixirpublishers.com (Elixir International Journal) Discrete Mathematics Elixir Dis. Math. 92 (2016) 38758-38763 Complement of the Boolean Function Graph B(K p, INC, K q )
More information{ 1} Definitions. 10. Extremal graph theory. Problem definition Paths and cycles Complete subgraphs
Problem definition Paths and cycles Complete subgraphs 10. Extremal graph theory 10.1. Definitions Let us examine the following forbidden subgraph problems: At most how many edges are in a graph of order
More informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More informationDOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1
Discussiones Mathematicae Graph Theory 32 (2012) 643 657 doi:10.7151/dmgt.1633 DOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1 Soufiane Khelifi Laboratory LMP2M, Bloc of laboratories
More informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More information11.1. Definitions. 11. Domination in Graphs
11. Domination in Graphs Some definitions Minimal dominating sets Bounds for the domination number. The independent domination number Other domination parameters. 11.1. Definitions A vertex v in a graph
More informationCLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN
CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.
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 informationSuper connectivity of line graphs
Information Processing Letters 94 (2005) 191 195 www.elsevier.com/locate/ipl Super connectivity of line graphs Jun-Ming Xu a,,minlü a, Meijie Ma a, Angelika Hellwig b a Department of Mathematics, University
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationIndependence Number and Cut-Vertices
Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationLOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF PATHS AND CYCLES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 303-4874, ISSN (o) 303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 561-57 DOI: 10.751/BIMVI1703561Ç Former BULLETIN OF THE
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 informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
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 informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationThe Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationA Vizing-like theorem for union vertex-distinguishing edge coloring
A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau Abstract We introduce a variant of the vertex-distinguishing
More informationEdge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
Theory and Applications of Graphs Volume 4 Issue 2 Article 2 November 2017 Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles Peter Johnson johnspd@auburn.edu Andrew Owens Auburn
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 informationGlobal Alliance Partition in Trees
Global Alliance Partition in Trees Linda Eroh Department of Mathematics University of Wisconsin Oshkosh, Oshkosh, WI, 54901 eroh@uwoshedu and Ralucca Gera Department of Applied Mathematics Naval Postgraduate
More informationPAIRED-DOMINATION. S. Fitzpatrick. Dalhousie University, Halifax, Canada, B3H 3J5. and B. Hartnell. Saint Mary s University, Halifax, Canada, B3H 3C3
Discussiones Mathematicae Graph Theory 18 (1998 ) 63 72 PAIRED-DOMINATION S. Fitzpatrick Dalhousie University, Halifax, Canada, B3H 3J5 and B. Hartnell Saint Mary s University, Halifax, Canada, B3H 3C3
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 informationAN ITERATIVE APPROACH TO THE IRREGULARITY STRENGTH OF TREES
AN ITERATIVE APPROACH TO THE IRREGULARITY STRENGTH OF TREES MICHAEL FERRARA, RONALD J. GOULD, MICHA L KAROŃSKI, AND FLORIAN PFENDER Abstract. An assignment of positive integer weights to the edges of a
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 informationRigidity, connectivity and graph decompositions
First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework
More informationDefinition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.
Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is
More informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
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 informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationINSTITUTE of COMBINATORICS and its APPLICATIONS
BULLETIN of the Volume 80 May 2017 INSTITUTE of COMBINATORICS and its APPLICATIONS Editors-in-Chief: Marco Buratti, Don Kreher, Tran van Trung Boca Raton, Florida ISSN: 1183-1278 BULLETIN OF THE ICA Volume
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 information1 Matchings with Tutte s Theorem
1 Matchings with Tutte s Theorem Last week we saw a fairly strong necessary criterion for a graph to have a perfect matching. Today we see that this condition is in fact sufficient. Theorem 1 (Tutte, 47).
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 informationIndependence and Cycles in Super Line Graphs
Independence and Cycles in Super Line Graphs Jay S. Bagga Department of Computer Science Ball State University, Muncie, IN 47306 USA Lowell W. Beineke Department of Mathematical Sciences Indiana University
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationPebbling on Directed Graphs
Pebbling on Directed Graphs Gayatri Gunda E-mail: gundagay@notes.udayton.edu Dr. Aparna Higgins E-mail: Aparna.Higgins@notes.udayton.edu University of Dayton Dayton, OH 45469 Submitted January 25 th, 2004
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 informationOpen Neighborhood Chromatic Number Of An Antiprism Graph
Applied Mathematics E-Notes, 15(2015), 54-62 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Open Neighborhood Chromatic Number Of An Antiprism Graph Narahari Narasimha
More informationThe Connectivity and Diameter of Second Order Circuit Graphs of Matroids
Graphs and Combinatorics (2012) 28:737 742 DOI 10.1007/s00373-011-1074-6 ORIGINAL PAPER The Connectivity and Diameter of Second Order Circuit Graphs of Matroids Jinquan Xu Ping Li Hong-Jian Lai Received:
More informationThe 4/5 Upper Bound on the Game Total Domination Number
The 4/ Upper Bound on the Game Total Domination Number Michael A. Henning a Sandi Klavžar b,c,d Douglas F. Rall e a Department of Mathematics, University of Johannesburg, South Africa mahenning@uj.ac.za
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 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 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 informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
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 informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationForced orientation of graphs
Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi Bardia Sadri Abstract The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994.
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 informationVertex Deletion games with Parity rules
Vertex Deletion games with Parity rules Richard J. Nowakowski 1 Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada rjn@mathstat.dal.ca Paul Ottaway Department of Mathematics,
More informationAN ITERATIVE APPROACH TO GRAPH IRREGULARITY STRENGTH
AN ITERATIVE APPROACH TO GRAPH IRREGULARITY STRENGTH MICHAEL FERRARA 1 UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 RONALD GOULD EMORY UNIVERSITY ATLANTA, GA 303 MICHA L KAROŃSKI ADAM MICKIEWICZ UNIVERSITY
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationOn Universal Cycles of Labeled Graphs
On Universal Cycles of Labeled Graphs Greg Brockman Harvard University Cambridge, MA 02138 United States brockman@hcs.harvard.edu Bill Kay University of South Carolina Columbia, SC 29208 United States
More informationConnection and separation in hypergraphs
Theory and Applications of Graphs Volume 2 Issue 2 Article 5 2015 Connection and separation in hypergraphs Mohammad A. Bahmanian Illinois State University, mbahman@ilstu.edu Mateja Sajna University of
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationPLANAR GRAPH BIPARTIZATION IN LINEAR TIME
PLANAR GRAPH BIPARTIZATION IN LINEAR TIME SAMUEL FIORINI, NADIA HARDY, BRUCE REED, AND ADRIAN VETTA Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, either
More informationVIZING S THEOREM AND EDGE-CHROMATIC GRAPH THEORY. Contents
VIZING S THEOREM AND EDGE-CHROMATIC GRAPH THEORY ROBERT GREEN Abstract. This paper is an expository piece on edge-chromatic graph theory. The central theorem in this subject is that of Vizing. We shall
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 informationON THE POWER DOMINATION PROBLEM IN GRAPHS
ON THE POWER DOMINATION PROBLEM IN GRAPHS Honors Thesis Presented to the Honors Committee of Texas State University-San Marcos Submitted in Partial Fulfillment of the Requirements For Graduation in the
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationSANDRA SPIROFF AND CAMERON WICKHAM
A ZERO DIVISOR GRAPH DETERMINED BY EQUIVALENCE CLASSES OF ZERO DIVISORS arxiv:0801.0086v2 [math.ac] 17 Aug 2009 SANDRA SPIROFF AND CAMERON WICKHAM Abstract. We study the zero divisor graph determined by
More informationPrime Labeling for Some Cycle Related Graphs
Journal of Mathematics Research ISSN: 1916-9795 Prime Labeling for Some Cycle Related Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University Rajkot 360 005, Gujarat,
More informationGraphs That Are Randomly Traceable from a Vertex
Graphs That Are Randomly Traceable from a Vertex Daniel C. Isaksen 27 July 1993 Abstract A graph G is randomly traceable from one of its vertices v if every path in G starting at v can be extended to a
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationLabelling Wheels for Minimum Sum Number. William F. SMYTH. Abstract. A simple undirected graph G is called a sum graph if there exists a
Labelling Wheels for Minimum Sum Number Mirka MILLER Department of Computer Science University of Newcastle, NSW 308, Australia e-mail: mirka@cs.newcastle.edu.au SLAMIN Department of Computer Science University
More informationPANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS
Discussiones Mathematicae Graph Theory xx (xxxx) 1 13 doi:10.7151/dmgt.2106 PANCYCLICITY WHEN EACH CYCLE CONTAINS k CHORDS Vladislav Taranchuk Department of Mathematics and Statistics California State
More information