CHAPTER 5. b-colouring of Line Graph and Line Graph of Central Graph
|
|
- Chad Knight
- 5 years ago
- Views:
Transcription
1 CHAPTER 5 b-colouring of Line Graph and Line Graph of Central Graph In this Chapter, the b-chromatic number of L(K 1,n ), L(C n ), L(P n ), L(K m,n ), L(K 1,n,n ), L(F 2,k ), L(B n,n ), L(P m ӨS n ), L[C(K n )], L[C(C n )], L[C(K 1,n )] are obtained along with its structural properties. 5.1 Introduction [32, 33, 38, 46, 76, 81] In Graph theory, the Line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between the edges of G. Other terms used for the Line graph are the covering graph, the edge-to-vertex dual, the conjugate, the representative graph, the edge graph, the interchange graph, the adjoint graph and the derived graph. One of the earliest and most important theorems about Line graphs is due to Hassler Whitney (1932), who proved that with one exceptional case the structure of G can be recovered completely from its Line graph. The Line graph is defined as follows. The Line graph [72, 81] of G denoted by L(G) is the intersection graph of the edges of G, representing each edge by the set of its two end vertices. Otherwise L(G) is a graph such that Each vertex of L(G) represents an edge of G. Two vertices of L(G) are adjacent if their corresponding edges share a common end point in G. Example Figure 1(a): Graph G Figure 1(b): Line graph L(G) 62
2 5.2 Properties of Line Graph [46,76] Properties of a graph G that depend only on adjacency between edges may be translated into equivalent properties in L(G) that depend on adjacency between vertices. For instance, a matching in G is a set of edges no two of which are adjacent, and corresponds to a set of vertices in L(G) no two of which are adjacent, i.e. an independent set. Some of the important properties of Line graph are as follows: The Line graph of a connected graph is connected. If G is connected, it contains a path connecting any two of its edges, which translates into a path in L(G) containing any two of the vertices of L(G). However, a graph G that has some isolated vertices, and is therefore disconnected, may nevertheless have a connected Line graph. A maximum independent set in a Line graph corresponds to maximum matching in the original graph. Since maximum matching may be found in polynomial time. so may the maximum independent sets of Line graphs, despite the hardness of the maximum independent set problem for more general families of graphs. The edge chromatic number of a graph G is equal to the vertex chromatic number of its Line graph L(G). The Line graph of an edge-transitive graph is vertex-transitive. If a graph G has an Euler cycle, that is, if G is connected and has an even number of edges at each vertex, then the Line graph of G is Hamiltonian. Line graphs are claw-free graphs, graphs without an induced subgraph in the form of a three-leaf tree. The Line graphs of trees are exactly the claw-free block graph. T = T(G) is Eulerian if and only if the Line graph L(G) is Eulerian. 5.3 b-chromatic Number of Line Graph of Star Graph K 1,n Theorem For every n,ϕ[l(k 1,n )] = n 63
3 Consider the Line graph K 1,n. The Line graph of K 1,n is a Complete graph with n-vertices. We know that the b-chromatic number of Complete graph K n requires n-colours for producing a b-colouring. Therefore ϕ[l(k 1,n )] = n. Example Figure 2(a): K 1,5 Figure 2(b):ϕ[L(K 1,5 )] =5 5.4 b-chromatic Number of Line Graph of Cycle Theorem For any Cycle C n, φ[l(c n )] =3 L(C n ) C n.. By Theorem [3.3.1], we have φ[l(c n )] =3 Example Figure 3: φ[l(c 8 )] =3 64
4 5.5 b-chromatic Number of Line Graph of Pan Graph Theorem The b-chromatic number of every Line graph of Pan graph is tricolourable. By definition, the n-pan graph is the graph obtained by joining the Cycle graph C n to K 1 with a bridge. Consider the Line graph of Pan graph. By the definition of Line graph, the vertex set of Line graph of Pan graph corresponds to edge set of Pan graph. Consider the Line graph of Pan graph, we see that every Line graph of Pan graph is a union of cycle C n with K 3. First we assign the colour to complete graph K 3, by colouring procedure it requires three colours for producing a b-chromatic colouring. If we assign any new colour to the cycle C n, then it does not produce b-chromatic colouring because the complete graph K 3 do not realizes the new colour. Thus, by the colouring procedure the b-chromatic number of every Line graph of Pan graph is three. Hence by very construction the above said colouring is maximal. Example Figure 4: Pan graph with four vertices Observation The Line graph of Pan Graph is a Diamond graph (when n=4 ). 65
5 5.6 b-chromatic Number of Line Graph of Complete Bipartite Graph Theorem For the Line graph K m,n, ϕ[l(k m,n )] = Max{m,n} for every m,n 2 Let K m,n be the Complete Bi-partite graph with bipartition (X,Y) where X={v 1,v 2,v 3..v m } and Y={u 1,u 2,u 3..u n }. Consider the Line graph of K m,n i.e. L(K m,n ). Let v ij be the edge between the vertex v i and u j for i=1,2,3..m, j =1,2,3..n i.e. v i u j = {v ij: 1 i m, 1 j n}. By the definition of the Line graph, edges in K m,n corresponds to the vertices in L(K m,n ) i.e. V [L(K m,n )]= {v ij : 1 i m, 1 j n}. Note that for each i, we say that < v ij: j=1,2,3..n > is a complete graph of order n. Also we say for each j, < v ij : i=1,2,3..m > forms a complete graph of order m. Clearly the number of cliques in L(K m,n ) is m+n. Case 1 when m < n By observation in L(K m,n ), we have K n > K m. Consider the colour class C={c 1,c 2,c 3..c n }. Now assign a proper colouring to the vertices as follows. First assign the colours to the vertices v ij (1 i m, :1 j n) as follows. Here < v mj : j=1,2,3..n > for m=1 forms a complete graph of order n. Assign c j to v 1j for j=1,2,3..n, which produces a b-chromatic colouring. Suppose if we assign any new colour to the remaining complete graph < v ij : i=2,3..n, j=1,2,3..n >, it contradicts the definition of b-chromatic colouring because the remaining complete graphs does not realize the new colour. Hence to make the colouring as b-chromatic one, assign the colouring as follows. First assign the colour c i to the vertex v ij when j=1, i=1,2,3..m and assign c j to v ij s when i=1, j=1,2,3..n. Next for i=2..3..m and j=2,3 n, assign the colour c i+j-1 to v ij s when i+j n+1 and assign c i+j-(n+1) when i+j > n+1. Now all the n vertices realize its own colour, which produces a b-chromatic colouring. Thus by the colouring procedure the above said colouring is maximum and b-chromatic. Therefore φ[l(k m,n )] =n. 66
6 Example Figure 5:ϕ[L(K 3,4 )] = 4 Case 2 when m > n In L(K m,n ) we have K m > K n. Consider the colour class C={c 1,c 2,c 3..c n }. Now assign a proper colouring to the vertices v ij (1 i m, 1 j n) as follows. Here <v ni: i=1,2,3..m> for n=1 forms a complete graph of order n. Assign c i to v i1 for i=1,2,3..m, which produces a b-chromatic colouring. Suppose if we assign any new colour to the remaining complete graph <v ij : i=2,3,..m, j=1,2,3..n>, it contradicts the definition of b-chromatic colouring. Hence to make the colouring as b-chromatic one, assign the colouring to the vertices as follows. First assign the colour c i to v ij when j=1, i=1,2 m and assign colour c j to v ij s when i=1, j=1,2,3..n. Next for i=2,3..m and j= 2,3 n, assign c i+j-1 to v ij when i+j m+1 and assign c i+j-(m+1) when i+j > m+1. Now here all m vertices realize its own colour, which produces a b-chromatic colouring. Thus by the colouring procedure the above said colouring is maximum and b-chromatic. Therefore φ[l(k m,n )] =m. 67
7 Example Figure 6:ϕ[L(K 4,3 )] = 4 Case 3 when m = n In this case, K m will become K n. Clearly the number of cliques in L(K n,n ) is 2n. By following the procedure given in above cases, we have φ[l(k n,n )] =n. Example Figure 7:ϕ[L(K 4,4 )] = 4 From all the above cases, φ[l(k m,n )] =Max{m,n}. 68
8 5.6.2 Structural Properties of Line Graph of Complete Bipartite Graph Number of vertices in L(K m,n ) = m+n Number of edges in L(K m,n )= (n+m-2) Maximum degree of L(K m,n ) is = m+n-2 Minimum degree of L(K m,n ) is δ = m+n Corollary Every Line graph of K m,n is a m+n-2 regular graph Theorem For any Complete Bipartite graph K m,n, the number of edges in L[K m,n ] = (n+m-2) q L[K m,n ] = Number of edges in all K n + Number of edges in all K m = m q(k n )+ n q(k m ) = m + n = m ( ) = (n-1+m-1) = (n+m-2) +n Therefore q[l(k m,n )] = (n+m-2) ( ) 5.7 b-chromatic Number of Line Graph of Double Star Graph Theorem ϕ[l(k 1,n,n )] =n for every n 2. Consider the Double Star graph K 1,n,n. It is the tree obtained from the Star graph K 1,n by adding a new pendant vertex to the existing n pendant vertices. Here K 1,n,n is a Double star graph with v as the root vertex along with the vertex set v 1, v 2,..., v n and v 1, v 2,..., v n together with 69
9 the edges u 1,u 2, u n and u 1,u 2, u n. Now construct the Line graph of K 1,n,n. By the definition of Line graph, the edge set in K 1,n,n corresponds to the vertex set of L(K 1,n,n ) respectively. i.e. V [L(K 1,n,n )] = {u i / 1 i n} {u i / 1 i n}. In L(K 1,n,n ) we say that the vertices u 1,u 2, u n induces a clique of order n(say K n ). Also we say that the vertices u i is adjacent with the vertex u i for i = 1,2,3.n. we assign a proper colouring to these vertices as follows. Consider a colour class C= {c 1,c 2, c n }. Assign the colour c i to the vertex u i for i = 1,2,3.n, here all the vertices in u i for i=1,2,3..n realizes its own colour. Hence the colouring is b-chromatic colouring. Next we assign the colour c n+1 to all u i for i=1,2,3.n, due to the above mentioned adjacency condition the vertex set {u i : i=1,2,3..n } does not realizes the colour c n+1. So there is a possibility of assigning only the preused colours to the vertices u 1,u 2, u n. Note that rearrangement of colours also does not accommodate the new colour class. Thus by the colouring procedure the above said colouring is maximum and b-chromatic colouring. Example Figure 8: K 1,n,n 70
10 Figure 9:ϕ[L(K 1,5,5 )]= Structural Properties of Line graph of Double Star Graph Number of vertices in L(K 1,n,n ) = 2n Number of edges in L(K 1,n,n ) = () Maximum degree of L(K 1,n,n ) is = n Minimum degree of L(K 1,n,n ) is δ = 1 n vertices are with degree n and Theorem q[l(k 1,n,n )]= q[l(k 1,n,n )] = Number of edges in K n + Number of edges not in K n = q(k n ) + Number of edges not in K n = + n = (1) +n 2 = ( ) 71
11 = = () = Therefore q[l(k 1,n,n )] = Theorem For every integer n, ϕ [L(K 1,n,n )] =ϕ[l(k 1,n )] = n The proof follows from the Theorem and b-chromatic Number of Line Graph of Fire Cracker Graph Theorem ϕ[l(f 2,k )] = k for k 2 Let G = F 2,k be the Fire cracker graph. By definition, (2,k) Fire Cracker graph is obtained by concatenation of 2,k stars by linking one leaf from each. Consider the Line graph of F 2,k. Let S be the vertex adjacent with both v and v. Here the vertex v along with v 1,v 2,..,v k-1, induces a clique of order k also the vertex v with v 1, v 2..., v k-2 induces another clique of order k. Thus in L(F 2,k ), we find two copies of mutually disjoint Complete subgraphs. Consider a colour class C= {c 1,c 2, c k }. Now assign a proper colouring to these vertices as follows. First assign the colour c 1 to the vertex v and c i+1 to the vertices v 1, v 2,..., v k-2 for i=1,2,3...k which produces a b-chromatic colouring. Next suppose if we assign any new colours to v and v i for i=1,2 k-1 then it will not produce a b-chromatic colouring. Similarly if we assign any colour to the root vertex S, again it fails to produce the b-chromatic colouring. Because here the vertex set v and v are mutually disjoint to each other. Thus the only possibility is to assign the same colour which we already assigned for the vertices v and v i for i=1,2,3..k-1 such as c 1 to v and c i+1 to v i for i=1,2,3 k-1 and the colour c 2 72
12 to the root vertex s. Now all the vertices vv i and vv i realizes its own colour, which produces a b-chromatic colouring. Thus by the colouring procedure the above said colouring produces a maximum and b-chromatic colouring. Example Figure 10: F 2,5 Figure 11: φ[l(f 2,5 )] = Structural Properties of Line Graph of Fire Cracker Graph Number of vertices in L(F 2,k ) = 2k+1 Number of edges in L(F 2,k )= 2( K+1 C 2 )+ 2 Maximum degree of L(F 2,k ) is = k Minimum degree of L(F 2,k ) is δ = 2 73
13 5.8.3 Theorem q[l(f n,k )] = n( K+1 C n )+ n where n=2 q[l(f n,k )] = Number of edges in all K k+1 + Number of edges not in any of the K k+1 = n q(k k+1 ) + Number of edges not in any of the K k = n () +n = n( k+1 C n )+n Therefore q[l(f n,k )] = n( K+1 C n )+ n Results under Observation ϕ[l(f 3,k )] = k for all k 2. ϕ[l(f 4,k )] = k for all k 2. ϕ[l(f 5,k )] = k for all k 2 and so on. 5.9 b-chromatic Number of L[B n,n ] and L[P m ӨS n ] Theorem For every n 2, φ[l(b n,n )] = n+1 Consider the Bistar B n,n. By definition of Bistar, let u 1,u 2,.u n be the n pendant edges attached to the vertex u and v 1,v 2,.v n be the another n pendant edges attached to the vertex v. For i=1,2,3..n, let u i be the edge between the vertex uu i and v i is the edge between the vertex vv i and w be the edge between u and v i.e. uu i = u i,vv i = v i and uv= w. Here w is adjacent with both the vertices u i and v i for i=1,2,3 n. Consider the Line graph of B n,n. By the definition of Line graph, the edge set of Bistar corresponds to the vertex set of L(B n,n ). In L[B n,n ] the vertices u i (i=1,2 n) along with w forms a complete graph of order n+1. Also we see that the vertices v i (i=1,2 n) together with w forms another complete graph of order n+1. 74
14 Thus it contains two copies of edge disjoint complete graph of order n+1 i.e. let K i n+1 be the cliques in L[B n,n ] for i 2. Number these complete sub graphs as K 1 2 n+1 and K n+1. Consider the colour class C={c 1,c 2,c 3 c n,c n+1 }. First assign the colour c i to u i for 1 i=1,2,3..n and c n+1 to w. Here in K n+1, vertices u i (i=1,2,3..n) and the vertex w realizes its own colour which produces a b-chromatic colouring. Next assign the colour c n+i+1 to the vertices v i (i=1,2,3..n) of K 2 n+1, here other than the vertex w none of the vertices u i and v i realizes the new colours, which does not produce a b-chromatic colouring because the vertices u i and v i are mutually disjoint. So we cannot assign any new colour to the vertices v i (i=1,2,3..n). Thus to make the colouring as b-chromatic one, we should assign only the same set of colours to v i (i=1,2,3..n) which we already assigned for u i (i=1,2,3 n). Now all the vertices u i,v i and w realizes its own colour, which produces a b-chromatic colouring. Thus by the colouring procedure the above said colouring is maximum and b-chromatic. Example Figure 12: φ [L(B 5,5 )] =6 75
15 5.9.2 Structural Properties of Line Graph of Bistar Number of vertices in L(B n,n ) = 2n+1 Number of edges in L(B n,n ) = n(n+1) Maximum degree of L(B n,n ) = 2n Minimum degree of L(B n,n ) = n-1 In L(B n,n ) there are two copies of edge disjoint K n+1. 2n vertices of degree n and 1 vertex of degree 2n Theorem For every n,m 2, φ[ L(P m ӨS n )] = n+1 Consider the tree P m ӨS n. Let its vertex set be defined as V={v 1,v 2,v 3..v 2n+m } and the edge set be defined as E={e 1,e 2,e 3,e n,e n+1.e n+m-1,e n+m,e n+m+1, e 2n+m-1 }. Consider the Line graph of P m ӨS n. By the definition of the Line graph, edge set in P m ӨS n corresponds to the vertex set of L[P m ӨS n ] i.e. V [L(P m ӨS n )] = {e i / 1 i 2n+m-1}. Here in L(P m ӨS n ), the vertices e 1,e 2,e 3,e n along with e n+1 forms a complete graph of order n+1 namely K 1 and the vertices e n+m,e n+m+1, e 2n+m-1 along with e n+m-1 forms another complete graph of order n+1 namely K 2. Thus we have two copies of mutually disjoint subgraphs. Consider the colour class C={c 1,c 2,c 3, c 4..c n,c n+1 }. Now assign a proper colouring to the above vertices as follows. By Theorem and by the colouring procedure we can assign same set of n+1 colours to the both the graphs K 1 and K 2 and assign any existing colours to the remaining vertices. Thus by the colouring procedure the above said colouring is maximum and b-chromatic. 76
16 Example Figure 13: L(P 5 ӨS 5 ) = Structural Properties of L(P m ӨS n ) Number of vertices in L(P m ӨS n )= 2n+m-1 Number of edges in L(P m ӨS n )= n 2 +n+m-1. The Maximum degree of L(P m ӨS n ) is = n+1. The Minimum degree of L(P m ӨS n ) is δ =2. In L(P m ӨS n ), there are 2n vertices of degree n, 2 vertices of degree n+1, and remaining vertices of degree 2. 77
17 5.10 b-chromatic Number of Line Graph of Central Graph of Complete Graph Theorem For any Complete graph K n, ϕ{l[c(k n )] } = n for n 2 Let K n be the Complete graph on n vertices and edge set of K n contains exactly edges. Consider the Central graph of Complete graph K n. By the definition of Central graph, let v ij be the newly introduced vertex in the edge connecting vertex v i v j in C(K n ). Let v i v ij =e ij and v ij v i =e ji. Clearly {e ij: 1 i n-1, i+1 j n}. Here we considered only undirected graph so that we have e ij = e ji. Consider the Line graph of Central graph of the Complete graph K n. By the definition of Line graph the edge set in C(K n ) corresponds to the vertex set of L[C(K n )]. Under observation we obtain n-copies of vertex disjoint K n-1 complete subgraphs. Now number these complete subgraphs in anticlockwise direction namely K 1 n-1, K 2 n-1.k n n-1 for i= 1,2,3, n i.e. K i n-1 be the cliques in L[C(K n )]. Therefore we say ϕ{l[c(k n )]} n-1. Assign a proper colouring to the above vertices as follows. Consider the colour class C = {c 1,c 2, c n, }. Assign the colour c 1,c 2,c 3..c n-1 to K i n-1 for i=1 and assign the colour c n to the vertices in the remaining subgraph K i n-1(i=2,3..n) in which the vertex is adjacent with K 1 n-1 and all the other vertices in K i n-1 for i=2,3..n to be coloured with the existing colours other than the colour c n. Now all the vertices realize its own colour which produces a b-chromatic colouring. Thus by the colouring procedure the above said colouring is maximum and b-chromatic. 78
18 Example Figure 14:ϕ{L[C(K 6 )] } = Structural Properties of Line Graph of Central Graph of Complete Graph Number of vertices in L[C(K n )] = n(n-1) Number of edges in L[C(K n )]= ( ) Maximum degree of L[C(K n )] is = n-1 Minimum degree of L[C(K n )] is δ = n-1 L[C(K n )] is Hamiltonian and Eulerian 79
19 Theorem ϕ{l[c(k 3 )]} =ϕ[c(k 3 )] By observation, we find that C(K 3 ) is C 6 and its Line graph is also C 6, since L(C n ) C n. Therefore by Theorem [3.3.1], we have ϕ{l[c(k 3 )]} =ϕ[c(k 3 )] 5.11 b-chromatic Number of Central Graph of Line Graph of Cycle and Line Graph of Central Graph of Cycle Theorem For any Cycle C n of length n 5, n=5x+r,0 < 5 ( +1) when 0 ϕ{c [L(C n )]}= when = 0 Here L(C n ) C n. By the property of Central graphs, C[L(C n )] C[C n. ]. Therefore by Theorem 4.3.1, we have ϕ{c [L(C n )]} = ϕ$%(% )& ( +1) when 0 = when = Structural Properties of Line Graph of Central Graph of Cycle Number of vertices in L[C(C n )] = () Number of edges in L[C(C n )] = n' +1( Maximum degree of L[C(C n )] is = 2(n-2) Minimum degree of L[C(C n )] is δ = n-1 2n vertices has degree n-1 and ( )) L[C(C n )] contains n copies of edge disjoint K n-1. vertices has degree 2(n-2) Theorem For any n 2, φ{l[c(c n )]} =n 80
20 5.12 b-chromatic Number of Line Graph of Central Graph of K 1,n Theorem For any Complete Bipartite graph K 1,n, ϕ{l[c(k 1,n )]} = n+1 for every n 2 Consider the Star graph K 1,n with vertices v 1, v 2,...,v n, v where v 1, v 2,..., v n be the pendant vertices of K 1,n and let v be the root vertex of K 1,n adjacent to v i for 1 i n. By the definition of the Central graph, each edge vv i for 1 i n of K 1,n is subdivided by a newly introduced vertex v i in C(K 1,n ) i.e. v 1, v 2,..., v n are the vertices of subdivision at each of the edges vv 1, vv 2, vv n of C(K 1,n ). By definition of C(K 1,n ), the vertices v 1, v 2,..., v n, induces a clique of order n (say K n ) in every C(K 1,n ). Let u i (i=1,2..n) be the edge between the vertex vv i and u i be the edge between the vertex v i v i. Now consider the Line graph of Central graph of K 1,n i.e. L[C(K 1,n )]. Here the edge set in C(K 1,n ) corresponds to the vertex set of L[C(K 1,n )]. Here in L[C(K 1,n )],the vertices <u i: 1 i n>forms a complete graph of order n. Also we see that each edge u i is adjacent with u i for i=1,2,3..n. In L[C(K 1,n )] we find the remaining n vertices are of degree n and nc 2 vertices of degree 2n-2. Now assign a proper colouring to the above vertices as follows. Consider the colour class c 1,c 2, c n,c n+1. First assign the colour c i to u i for i=1,2,3..n and assign the colour c n+i to u i for i=1,2,3..n. Here the vertices u i do not realize the colour c n+i, which does not produce b-chromatic colouring. To make the colouring as b-chromatic one, assign the colour to the remaining vertices as follows. Assign the colour c n+1 to u i for i=1,2,3.n. Here each u i is adjacent with with n vertices. Consider any arbitrary vertex u i for i=1,2,3..n. Assign the colour c 1,c 2, c n to the vertices adjacent with u i other than the colour assigned to u i. Note that rearrangement of colours also does not accommodate new colour class. Thus by colouring procedure the above said colouring is maximum and b-chromatic colouring. 81
21 Example Figure 15: K 1,n Figure 16:C(K 1,n ) 82
22 Figure 17:ϕ[L{C(K 1,3 )}] = Structural Properties of Line Graph of Central Graph of Star Graph Number of vertices in L[C(K 1, n )] = ()) Number of edges in L[C(K 1, n )]= * Maximum degree of L[C(K 1, n )] is = 2(n-1) Minimum degree of L[C(K 1, n )] is δ = n Remark L[C(K 1,1 )] = C 3 L[C(K 1,2 )] = C 5 83
CHAPTER 7. b-colouring of Middle Graph and Middle Graph of Central Graph
CHAPTER 7 b-colouring of Middle Graph and Middle Graph of Central Graph In this Chapter, the structural properties of Cycle, Path, Star graph, Fan graph, Sunlet graph, Double Star graph, Bistar, Complete
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 informationChapter 4. Triangular Sum Labeling
Chapter 4 Triangular Sum Labeling 32 Chapter 4. Triangular Sum Graphs 33 4.1 Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is
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 informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
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 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 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 informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS Anna University 2 & 16 Mark Questions & Answers Year / Semester: IV /
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 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 informationCME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh HW#3 Due at the beginning of class Thursday 02/26/15
CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh (rezab@stanford.edu) HW#3 Due at the beginning of class Thursday 02/26/15 1. Consider a model of a nonbipartite undirected graph in which
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
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 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 informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
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 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 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 informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
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 informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
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 informationChapter 6 GRAPH COLORING
Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
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 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 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 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 informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationCME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh HW#3 Due at the beginning of class Thursday 03/02/17
CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh (rezab@stanford.edu) HW#3 Due at the beginning of class Thursday 03/02/17 1. Consider a model of a nonbipartite undirected graph in which
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 informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationGraph theory - solutions to problem set 1
Graph theory - solutions to problem set 1 1. (a) Is C n a subgraph of K n? Exercises (b) For what values of n and m is K n,n a subgraph of K m? (c) For what n is C n a subgraph of K n,n? (a) Yes! (you
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 informationCharacterizations of graph classes by forbidden configurations
Characterizations of graph classes by forbidden configurations Zdeněk Dvořák September 14, 2015 We consider graph classes that can be described by excluding some fixed configurations. Let us give some
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 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 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 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 informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationMatchings and Covers in bipartite graphs
Matchings and Covers in bipartite graphs A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent.
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
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 informationBinding Number of Some Special Classes of Trees
International J.Math. Combin. Vol.(206), 76-8 Binding Number of Some Special Classes of Trees B.Chaluvaraju, H.S.Boregowda 2 and S.Kumbinarsaiah 3 Department of Mathematics, Bangalore University, Janana
More informationCMSC Honors Discrete Mathematics
CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical
More informationHW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.
1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,
More informationStar coloring planar graphs from small lists
Star coloring planar graphs from small lists André Kündgen Craig Timmons June 4, 2008 Abstract A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We
More informationPreimages of Small Geometric Cycles
Preimages of Small Geometric Cycles Sally Cockburn Department of Mathematics Hamilton College, Clinton, NY scockbur@hamilton.edu Abstract A graph G is a homomorphic preimage of another graph H, or equivalently
More informationVertex 3-colorability of claw-free graphs
Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,
More informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
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 informationV10 Metabolic networks - Graph connectivity
V10 Metabolic networks - Graph connectivity Graph connectivity is related to analyzing biological networks for - finding cliques - edge betweenness - modular decomposition that have been or will be covered
More informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
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 informationTHE LEAFAGE OF A CHORDAL GRAPH
Discussiones Mathematicae Graph Theory 18 (1998 ) 23 48 THE LEAFAGE OF A CHORDAL GRAPH In-Jen Lin National Ocean University, Taipei, Taiwan Terry A. McKee 1 Wright State University, Dayton, OH 45435-0001,
More informationA generalization of Mader s theorem
A generalization of Mader s theorem Ajit A. Diwan Department of Computer Science and Engineering Indian Institute of Technology, Bombay Mumbai, 4000076, India. email: aad@cse.iitb.ac.in 18 June 2007 Abstract
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 informationTHE SEMIENTIRE DOMINATING GRAPH
Advances in Domination Theory I, ed VR Kulli Vishwa International Publications (2012) 63-70 THE SEMIENTIRE DOMINATING GRAPH VRKulli Department of Mathematics Gulbarga University, Gulbarga - 585 106, India
More information4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.
UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.
More informationChapter 5. Fibonacci Graceful Labeling of Some Graphs
Chapter 5 ibonacci Graceful Labeling of Some Graphs 12 Chapter 5. ibonacci and Super ibonacci Graceful Labeling of Some Graphs 13 5.1 Introduction The brief account of graceful labeling is given in chapter
More informationChapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
More informationLecture Notes on Graph Theory
Lecture Notes on Graph Theory Vadim Lozin 1 Introductory concepts A graph G = (V, E) consists of two finite sets V and E. The elements of V are called the vertices and the elements of E the edges of G.
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 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 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 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 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 informationArtificial Intelligence
Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
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 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 informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationLecture 3: Recap. Administrivia. Graph theory: Historical Motivation. COMP9020 Lecture 4 Session 2, 2017 Graphs and Trees
Administrivia Lecture 3: Recap Assignment 1 due 23:59 tomorrow. Quiz 4 up tonight, due 15:00 Thursday 31 August. Equivalence relations: (S), (R), (T) Total orders: (AS), (R), (T), (L) Partial orders: (AS),
More informationA Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 10, no. 2, pp. 159 190 (2006) A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs Grant A. Cheston Tjoen
More informationGracefulness of a New Class from Copies of kc 4 P 2n and P 2 * nc 3
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 75-81 Research India Publications http://www.ripublication.com Gracefulness of a New Class from Copies
More informationDiscrete Wiskunde II. Lecture 6: Planar Graphs
, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is
More informationSUBDIVISIONS OF TRANSITIVE TOURNAMENTS A.D. SCOTT
SUBDIVISIONS OF TRANSITIVE TOURNAMENTS A.D. SCOTT Abstract. We prove that, for r 2 and n n(r), every directed graph with n vertices and more edges than the r-partite Turán graph T (r, n) contains a subdivision
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationMa/CS 6b Class 5: Graph Connectivity
Ma/CS 6b Class 5: Graph Connectivity By Adam Sheffer Communications Network We are given a set of routers and wish to connect pairs of them to obtain a connected communications network. The network should
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 informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
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 information2 1 GRAPHS WITH FORBIDDEN SUBGRAPHS
Jnstitute for Social Res&yn^ 2 1 GRAPHS WITH FORBIDDEN SUBGRAPHS Gary Chartrand, Dennis Geller, and Stephen Hedetniemi Introduction. Many graphs which are encountered in the study of graph theory are characterized
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 informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationIntroduction to Graphs
Graphs Introduction to Graphs Graph Terminology Directed Graphs Special Graphs Graph Coloring Representing Graphs Connected Graphs Connected Component Reading (Epp s textbook) 10.1-10.3 1 Introduction
More informationModules. 6 Hamilton Graphs (4-8 lectures) Introduction Necessary conditions and sufficient conditions Exercises...
Modules 6 Hamilton Graphs (4-8 lectures) 135 6.1 Introduction................................ 136 6.2 Necessary conditions and sufficient conditions............. 137 Exercises..................................
More informationCLASSES OF VERY STRONGLY PERFECT GRAPHS. Ganesh R. Gandal 1, R. Mary Jeya Jothi 2. 1 Department of Mathematics. Sathyabama University Chennai, INDIA
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 10 2017, 334 342 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Abstract: CLASSES
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008
The University of Sydney MATH99/09 Graph Theory Tutorial (Week 9) 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find
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 informationCPCS Discrete Structures 1
Let us switch to a new topic: Graphs CPCS 222 - Discrete Structures 1 Introduction to Graphs Definition: A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs
More informationChordal Graphs: Theory and Algorithms
Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also
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 information8 Matroid Intersection
8 Matroid Intersection 8.1 Definition and examples 8.2 Matroid Intersection Algorithm 8.1 Definitions Given two matroids M 1 = (X, I 1 ) and M 2 = (X, I 2 ) on the same set X, their intersection is M 1
More informationHypo-k-Totally Magic Cordial Labeling of Graphs
Proyecciones Journal of Mathematics Vol. 34, N o 4, pp. 351-359, December 015. Universidad Católica del Norte Antofagasta - Chile Hypo-k-Totally Magic Cordial Labeling of Graphs P. Jeyanthi Govindammal
More information