Chromatic Zagreb Indices for Graphical Embodiment of Colour Clusters
|
|
- Wilfred Fleming
- 5 years ago
- Views:
Transcription
1 Chromatic Zagreb Indices for Graphical Embodiment of Colour Clusters Johan Kok arxiv: v1 [math.gm] 1 Nov 016 Tshwane Metropolitan Police Department, City of Tshwane, South Africa kokkiek@tshwane.gov.za Sudev Naduvath Centre for Studies in Discrete Mathematics Vidya Academy of Science & Technology Thrissur, India. sudevnk@gmail.com Muhammad Kamran Jamil Department of Mathematics Riphah Institute of Computing and Applied Sciences Riphah International University Lahore, Pakistan. m.kamran.sms@gmail.com Abstract For a colour cluster C = (C 1, C, C 3,..., C l ), where C i is a colour class such that C i = r i, a positive integer, we investigate two types of simple connected graph structures G C 1, GC which represent graphical embodiments of the colour cluster such that the chromatic numbers χ(g C 1 ) = χ(gc ) = l and min{ε(g C 1 )} = min{ε(gc )} = l r i 1. Therefore, the problem is the edge-minimality inverse to finding the chromatic number of a given simple connected graph. In this paper, we also discuss the chromatic Zagreb indices corresponding to G C 1, GC. Keywords: Graphical embodiments; colour clusters; colour classes; chromatic Zagreb indices. Mathematics Subject Classification: 05C15, 05C38, 05C75, 05C85. 1
2 Chromatic Zagreb indices for graphical embodiment of colour clusters 1 Introduction For general notation and concepts in graphs and digraphs see [3, 4, 6, 1]. Unless mentioned otherwise all graphs we consider in this paper are finite, simple, connected and undirected graphs. The chromatic number χ(g) 1 of a graph G is the minimum number of distinct colours that allow a proper colouring of G. Such a colouring is called a chromatic colouring. of G. The colour weight of a colour in a graph G is the number of times a colour c j has been allocated to the vertices of G, denoted by θ(c j ) 1. In other words, the colour weight of a colour c i can be considered as the cardinality of the corresponding colour class in the graph concerned. Analogous to set theory notation, let C = C i, and be called a colour 1 i χ(g) cluster. It is noted that for χ(g) a graph G C with max{ε(g C )} that requires the colour cluster C to allow exactly a chromatic colouring (minimum proper colouring) is the complete χ(g)-partite graph K θ(c1 ),θ(c ),...,θ(c χ(g) ) or put differently, the complete l-partite graph with vertex partitioning V i (G C ), 1 i l such that V i (G C ) = C i, and V i (G C ) = V (G C ). Therefore, if C i = 1, 1 i χ(g) it 1 i l is a complete graph, K χ(g). For the colour cluster C = (C 1 ) the graph G C is a null graph (no edges). Energy can entirely be transformed and transmitted as energy waves. The electromagnetic spectrum of these energy waves ranges between cosmic rays, gamma rays, X-rays, ultra violet rays, optical light with its inherent spectrum of optical colours, infra-red rays, micro waves, short radio waves and long radio waves. These waves or rays transmit at the speed of light. An energy unit per wave (or ray) type is the amount of energy transmitting per second. All such energy units are simply called, colours. If for a given finite cluster of distinct energy units (colours), the colours must be linked to ensure connectivity but same colours must remain apart to prevent merging, then the problem we investigate is that of finding a simple connected graphical embodiment allowing the colours as a proper colouring. More specifically the problem to be considered is to find properties and related results of a connected graph G C with min{ε(g C )} that allows the prescribed colour cluster C as a chromatic colouring. Henceforth the graph G C will mean a graph with minimum edges allowing C as a chromatic colouring. Graphical Embodiment of C We note that the cycle C 5 has χ(c 5 ) = 3 with colour cluster say, C = (c 1, c 1, c, c, c 3 ). However, path P 5 is a graph with minimum number of edges that allows C as a proper colouring (not chromatic colouring). This observation leads us to our first useful result given below. Lemma.1. For any colour cluster C = (C 1, C, C 3,..., C l ) with C i = r i > 0, l, 1 i l, the connected graphical embodiment with minimum edges that allows C a proper colouring has l r i 1 edges.
3 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 3 Proof. Label the r i vertices corresponding to C i to be v i,1, v i,, v i,3,..., v i,ri, 1 i l. Add the edges v 1,1 v j,k, for all j l, 1 k r j. Also, add the edges v 1,i v,1, i r 1. Clearly, the graph G 1 obtained is a tree for which C is a proper colouring. Also, since G 1 is a connected acyclic graph, it has minimum number of edges, r i 1. The construction methodology mentioned in the proof of Lemma.1 may be called the Type-I graphical embodiment. In order to obtain a G C, we consider the induced star subgraph v 1,1, v,1, v 3,1,..., v l,1 of G 1 and add the edges to obtain a complete subgraph, K l. Note that 1 (l 1)(l ) edges were added to the graph G 1. An alternative construction of such a graph G C can be done by utilising the initial edges v i,1 v i+1,j, 1 i l 1, 1 j r i+1 as well as the edges v,1 v 1,j, j r 1 to obtain graph G. The aforesaid construction is called the Type-II graphical embodiment. Thereafter, consider the induced path subgraph v 1,1, v,1, v 3,1,..., v l,1 and add the required 1(l 1)(l ) edges to obtain the complete subgraph, K l. This brings us to the existence of the following theorem. Theorem.. For any colour cluster C, at least one graphical embodiment exist with minimum number of edges for which C is a chromatic colouring and χ(g C ) = l. Proof. As stated above, for the colour cluster C = (C i ) 1 i l and C i = C j = 1, for all values of i, j, the graph G C is complete. Hence, at least one graph with required properties exists. For all other colour clusters, the result is a direct consequence of Lemma.1 and the alternative construction of G C. We note that for a colour cluster C = (C 1, C ) the graph G C is acyclic. For colour clusters C = (C i ), i 3 the graphical embodiment G C has a unique maximum clique. Figure 1(a) and Figure 1(b) depict G C 1, G C for C = (c 1, c 1, c 1, c 1, c 1, c, c, c, c, c 3, c 3, c 3, c 4, c 4, c 4 ) = ((c 1, c 1, c 1, c 1, c 1 ), (c, c, c, c ), (c 3, c 3, c 3 ), (c 4, c 4, c 4 )). (a) (b) Figure 1
4 4 Chromatic Zagreb indices for graphical embodiment of colour clusters 3 Chromatic Zagreb Indices of G C The topological graph indices related to irregularity of a graph namely the first Zagreb index, M 1 (G) and the second Zagreb index, M (G) are of the oldest irregularity measures researched. A new irregularity of G has been introduced in [] as irr(g) = imb(e), where imb(e) = d(v) d(u). In [5], this irregularity index e E(G) was named the third Zagreb index to conform with the terminology of chemical graph theory. Recently, the topological index called total irregularity has been introduced in [1] as irr t (G) = 1 d(u) d(v). This irregularity index may be u,v V (G) called the fourth Zagreb index. The study of Zagreb indices is strongly dependent on the structural property of the edges and subsequently the degree of the vertices of the graph under study. A vertex colouring with colours of minimum subscripts is called a minimum parameter colouring. Unless stated otherwise, the colour sets we consider in this paper are minimum parameter colour sets. The weight of a colour c i is defined to be the number of times the colour c i is allocated to vertices of a graph G and is denoted by θ(c i ). If ϕ : v i c j, then we write c(v i ) = c j. The notion of chromatic Zagreb indices was introduced in [9]. For ease of reference we also recall that the first three Zagreb indices are defined as: M 1 (G) = M (G) = M 3 (G) = d (v i ) = n 1 n 1 n 1 (d(v i ) + d(v j )) vi v j E(G) (3.1) j= d(v i )d(v j ) vi v j E(G) (3.) j= d(v i ) d(v j ) vi v j E(G) (3.3) j= We define the default values, M 1 (K 1 ) = M (K 1 ) = M 3 (K 1 ) = 0. Note that the Zagreb indices are all functions of the degree of vertices of graph G. For a given graph, the vertex degrees are invariants. If the invariants d(v i ), v i V (G) are replaced by the parameters s, c(v i ) = c s, v i V (G) the chromatic Zagreb indices are defined. Note that for any minimum parameter set of colours C, C = l, a graph G has l! minimum parameter colourings. Denote these colourings ϕ t (G), 1 t l!. Define the variable chromatic Zagreb indices as: M ϕt 1 (G) = = M ϕt (G) = s, c(v i ) = c s, 1 t l!, (3.4) θ(c j ) j, c j C, (3.5) n 1 (s k) vi v j E(G), c(v i ) = s, c(v j ) = k, 1 t l!, (3.6) j=
5 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 5 M ϕt 3 (G) = n 1 s k vi v j E(G), c(v i ) = s, c(v j ) = k, 1 t l!. (3.7) j= From the above we define the minimum and maximum chromatic Zagreb indices as follows: M ϕ 1 (G) = min{m ϕt 1 (G) : 1 t l!}, M ϕ+ 1 (G) = max{m ϕt 1 (G) : 1 t l!}, M ϕ (G) = min{m ϕt (G) : 1 t l!}, M ϕ+ (G) = max{m ϕt (G) : 1 t l!}, M ϕ 3 (G) = min{m ϕt 3 (G) : 1 t l!}, M ϕ+ 3 (G) = max{m ϕt 3 (G) : 1 t l!}. By convention we define the default values M ϕ (K 1 ) = M ϕ+ (K 1 ) = 0, and M ϕ 3 (K 1 ) = M ϕ+ 3 (K 1 ) = 1. In view of the above mentioned terminology, we also observe the following useful lemma. Lemma 3.1. For a graph G with chromatic colouring C = (c 1, c, c 3,..., c k ), the graph G + e, e = c i c j, i j has M ϕt 1 (G) = M ϕt 1 (G + e) and therefore, M ϕ 1 (G) = M ϕ 1 (G + e) and M ϕ+ 1 (G) = M ϕ+ 1 (G + e). Proof. Because the M ϕt 1 (G) is defined in terms of the colour subscript only and χ(g) = χ(g + e) the result follows immediately. 3.1 Application to G C In this discussion, we will consider a specific initiation colour cluster from amongst the l! orderings of the colour classes. That is, we consider a colour cluster C = (C 1, C, C 3,..., C l ) with C i C i+1, 1 i l 1. Note that θ(c i ) = C i = r i. It implies that if after a mapping, say c j c f(i), then θ(c j ) θ(c f(i) ) and r j r f(i). Hence, the notation styles may be used interchangeably depending on which notation proffers the idea best. The convention is to determine the minimum chromatic Zagreb index directly in terms of the initiation colour cluster and the definition of construction. Determining the maximum chromatic Zagreb index will follow from an appropriate colour mapping. First, we recall important results that have been proved in [9]. Theorem 3.. [9] For a finite tree of order n 4, we have (i) n + 3 M ϕ 1 (T ) M ϕ+ 1 (T ) 4n 3; (ii) M ϕ (T ) = M ϕ+ (T ) = (n 1); (iii) M ϕ 3 (T ) = M ϕ+ 3 (T ) = n 1.
6 6 Chromatic Zagreb indices for graphical embodiment of colour clusters Applying Lemma 3.1 to the G C, where C = (C 1, C ), we have the next result as follows. Corollary (i) θ(c 1 )+θ(c )+3 M ϕ 1 (G C ) M ϕ+ 1 (G C ) 4(θ(c 1 )+θ(c )) (ii) M ϕ (G C ) = M ϕ+ (G C ) = (θ(c 1 ) + θ(c ) 1). (iii) M ϕ 3 (G C ) = M ϕ+ 3 (G C ) = θ(c 1 ) + θ(c ) 1. Proposition 3.4. [9]. For complete r-partite graphs, r, we have (i) M ϕt 1 (Kn, n, n,..., n) = n r(r + 1)(r + 1). 6 }{{} r entries r (ii) M ϕt (Kn, n, n,..., n) = n i (i 1). }{{} r entries (iii) M ϕt 3 (Kn, n, n,..., n) = n r 1 i(r 1). }{{} r entries Proposition 3.4 finds immediate application for G C max edges if C i = C j, i, j. We also present closed formula for Proposition 3.4 (ii),(iii). Lemma 3.5. For a complete r-partite graph Kn, n, n,..., n, we have }{{} r entries (i) M ϕt (Kn, n, n,..., n) = n [r 4 r(r+1)(r+3)]. 4 }{{} r entries (ii) M ϕt 3 (Kn, n, n,..., n) = n r(r 1). }{{} r entries Proof. We proof the results through substitution. r (i) Since n i (i 1) = n [ r i 3 r i ] = n [ r i 3 r and r i 3 = ( r(r+1) ) and r and simplification. (ii) Since n r 1 i ] = n [ r i 3 r i ] i = r(r+1)(r+1) 6, the result follows through substitution i(r 1) = n (r 1) r 1 i and r 1 i = r(r 1), the result follows. Note that both Type-I and II construction of a graph G with minimum edges which allows C as a proper colouring have χ(g) l. This will be true for any other construction type. Therefore, each construction type is extended to a well defined complete subgraph to obtain G C, except for the case l =. From [9] the chromatic Zagreb indices for complete graphs are known. Theorem 3.6. Any two graphs G C 1, G C which allow the colour cluster C as a chromatic colouring have M1 C (G C 1 ) = M1 C (G C ) and M1 C+ (G C 1 ) = M1 C+ (G C ). Proof. The result is a direct consequence of the definition.
7 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 7 The following theorem discusses whether a thorn complete graph can be the graphical embodiment of a colour cluster. Theorem 3.7. For a colour cluster C = (C i ) 1 i l, any thorn complete graph Kl of order l C i corresponds to a graphical embodiment of the colour cluster with min{ε(k l )}. Proof. Since, χ(kl ) = l and a minimum number of pendant vertices exist to allocate exactly C i 1, 1 i l colours to pendant vertices, the result follows immediately. Note that Theorem 3.7 provides a sufficient condition only. We know that all odd cycles C n, n 5, have chromatic number 3. These cycles are triangle-free and have min{ε(c n )} for the corresponding colour cluster ((c 1, c 1,..., c 1 ), (c }{{}, c,..., c ), (c }{{} 3 )), t entries t entries where n = t + 1. We extend this study by analysing the chromatic Zagreb indices for the Type-I and II constructions for a colour cluster C = (C 1, C, C 3,..., C l ) with C i C i+1, 1 i l Analysis of chromatic Zagreb indices for G C 1 Proposition 3.8. For the colour cluster C the graph G 1 obtained from the Type-I construction has (i) M C 1 (G 1 ) = 1 (G 1 ) = θ(c i ) i ; θ(c i ) (l (i 1)). (ii) M C (G 1 ) = (l 1) + (G 1 ) = l(l 1) + (iii) M C 3 (G 1 ) = l 1 + θ(c i ) i; θ(c i ) l(l (i 1)). θ(c i ) (i 1); 3 (G 1 ) = (l 1) + θ(c i ) (l (i 1)). Proof. (i) Follows directly from the definition of the first chromatic Zagreb index. (ii) Each edge v,1 v i,j, j r 1 has product value of. Therefore the first term. The second term follows by similar reasoning in respect of each colour c i, i l. Therefore the second term hence, the result for the minimum second
8 8 Chromatic Zagreb indices for graphical embodiment of colour clusters chromatic Zagreb index follows. The maximum second chromatic Zagreb index follows similarly in respect of the map c i c l (i 1). (iii) The minimum third chromatic Zagreb index follows by similar reasoning as in part (ii) and the maximum third chromatic Zagreb index follows in respect of the map c l c 1, c 1 c, c c 3... c l c l 1. Corollary 3.9. For the colour cluster C, the graph G C 1 has: (i) M C 1 (G C 1 ) = 1 (G C 1 ) = θ(c i ) i ; θ(c i ) (l (i 1)). (ii) M C (G C 1 ) = (l 1) + (G C 1 ) = l(l 1) + (iii) M C 3 (G C 1 ) = l 1 + θ(c i ) i + j i; θ(c i ) l(l (i 1)) + θ(c i ) (i 1) + 3 (G C 1 ) = (l 1) + θ(c i ) (l (i 1)) + i=j+1 j i. i (l + 1 i); i (l + 1 i). Proof. For parts (i), (ii) and (iii), the additional sums terms follow from the known results for the corresponding complete graph on vertices v j,1, j l Analysis of chromatic Zagreb indices for G C Proposition For the colour cluster C the graph G obtained from the Type-II construction has (i) M C 1 (G ) = 1 (G ) = θ(c i ) i ; θ(c i ) (l (i 1)). (ii) M C (G ) = (θ(c 1 ) 1) + i(i + 1) θ(c i+1 ); M C+ (G ) = l(l 1) (θ(c 1 ) 1) + i(i + 1) θ(c (l (i 1)) ).
9 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 9 Proof. (iii) M C 3 (G ) = θ(c i ) l; 3 (G ) = (θ(c 1 ) 1) + (l (i 1)) θ(c i ). (i) Follows directly from the definition of the first chromatic Zagreb index. (ii) The first term follows from the edges v,1 v 1,i, i r 1. The second term follows directly from the definition of the second chromatic Zagreb index. (iii) Define the map c 1 c l, c c 1, c 3 c l 1, c 4 c, c 5 c l and so on. Clearly, this mapping ensures maximal adjacency differences for all combinations of the distinct colours. Therefore the result follows through similar reasoning used in part (ii). Corollary For the colour cluster C, the graph G C has (i) M1 C (G C ) = θ(c i ) i ; 1 (G C ) = θ(c i ) (l (i 1)). (ii) M C (G C ) = (θ(c 1 ) 1) + M C+ (G C ) = l(l 1) (θ(c 1 ) 1) + (iii) M C 3 (G C ) = θ(c i ) l + 3 (G C ) = (θ(c 1 ) 1) + i(i + 1) θ(c i+1 ) + i(i + 1) θ(c (l (i 1)) ) + j i (l ); (l (i 1)) θ(c i ) + j i. i=i j i; Proof. For parts (i), (ii) and (iii), the additional sums terms follow from the additional edges added, on completing the graph on the path v 1,i, 1 i l. Note that for M3 C (G C ) the initial expression obtain is M3 C (G C ) = l θ(c i ) l + l (i+(l )) l ( i=j+ i j ) which then simplifies to the result. 4 Application to Certain Positive Non-Increasing Finite Integer Sequences In this section, we consider two positive non-increasing finite integer sequences. It lays the basis for investigating other such sequences. j i.
10 10 Chromatic Zagreb indices for graphical embodiment of colour clusters 4.1 Positive integers The first sequence is defined as a mirror image of the positive integers. Let s 1 = {a n }, a i = l (i 1), 1 i l. Also, let θ(c i ) = a i. Consider the corresponding colouring cluster C = (C i ), 1 i l. Theorem 4.1. Let C = (C i ), 1 i l, and θ(c i ) = a i, a i s 1. Then, for the colour cluster C the graph G C 1 obtained from the Type-I construction has (i) M C 1 (G C 1 ) s1 = 1 (G C 1 ) s1 = (l (i 1)) i ; (l (i 1)) 3. (ii) M C (G C 1 ) s1 = (l 1) + (G C 1 ) s1 = l(l 1) + (iii) M C 3 (G C 1 ) s1 = l 1 + i (l (i 1)) + l (l (i 1)) + (i 1) (l (i 1)) + 3 (G C 1 ) s1 = (l 1) + (l (i 1)) + i=j+1 j i; j i. i (l + 1 i); i (l + 1 i). and for the colour cluster C the graph G C obtained from the Type-II construction has (i) M C 1 (G C ) s1 = 1 (G C ) s1 = (l (i 1)) i ; (l (i 1) 3. (ii) M C (G C ) s1 = (l 1) + M C+ (G C ) s1 = l(l 1) (l 1) + (iii)m C 3 (G C ) s1 = i(i + 1) (l i) + (l (i 1)) l + 3 (G C ) s1 = (l 1) + i(i + 1)(i 1) + j i (l ); (l (i 1)) + j i. i=i j i; j i.
11 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 11 Proof. For Type-I graphical embodiment, we have Part (i)(a): Follows from definition of the first chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = l (i 1). Part (i)(b): Follows from definition of the first chromatic Zagreb index, the Type- I graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c i c l (i 1). Part (ii)(a): Follows from definition of the second chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = l (i 1). Part (ii)(b): Follows from definition of the second chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c i c l (i 1). Part (iii)(a): Follows from definition of the third chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = l (i 1). Part (iii)(b): Follows from definition of the third chromatic Zagreb index, the Type- I graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c l c 1, c 1 c, c c 3... c l c l 1. and for Type-II graphical embodiment, we have Part (i)(a): Follows from definition of the first chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = l (i 1). Part (i)(b): Follows from definition of the first chromatic Zagreb index, the Type- II graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c i c l (i 1). Part (ii)(a): Follows from definition of the second chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = l (i 1). Part (ii)(b): Follows from definition of the second chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c i c l (i 1). Also note that l j i = ( l 1 (i(l i) l i). Part (iii)(a): Follows from definition of the third chromatic Zagreb index, the Type- II graphical embodiment and the fact that θ(c i ) = l (i 1). Part (iii)(b): Follows from definition of the third chromatic Zagreb index, the Type- II graphical embodiment and the fact that θ(c i ) = l (i 1) and the mapping c l c 1, c 1 c, c c 3... c l c l 1. Remark 4.1. The summation identities l ( n(n+1) ), i = n(n+1), i = n(n+1)(n+1) 6, i 3 = i 4 = 6l5 +15l 4 +10l 3 l 30 find partial closure of the results above. For ex- ample, M1 C (G C 1 ) s1 = l (l (i 1)) i = l4 +4l 3 +5l +l. The partial closure of the 1 other results can also be established in a straight forward manner.
12 1 Chromatic Zagreb indices for graphical embodiment of colour clusters 4. Fibonacci numbers The second sequence we consider is the mirror image of the Fibonacci sequence. Let f 0 = 0, f 1 = 1 and f n = f n 1 + f n, where n. Let s = {a n }, a i = f l (i 1), 1 i l. Theorem 4.. Let C = (C i ), 1 i l, and θ(c i ) = a i, a i s. Then, for the colour cluster C the graph G C 1 obtained from the Type-I construction has (i) M C 1 (G C 1 ) s = 1 (G C 1 ) s = f l (i 1) i ; f l (i 1) (l (i 1)). (ii) M C (G C 1 ) s = (f l 1) + i f (l (i 1)) + (G C 1 ) s = l (f l 1) + (iii) M C 3 (G C 1 ) s = l 1 + j i; f l (i 1) l(l (i 1)) + f l (i 1) (i 1) + 3 (G C 1 ) s = (l 1) + f l (i 1) (l (i 1)) + i=j+1 i (l + 1 i); j i. i (l + 1 i). and for the colour cluster C the graph G C obtained from the Type-II construction has (i) M C 1 (G C ) s = 1 (G C ) s = f l (i 1) i ; f l (i 1) (l (i 1)). (ii) M C (G C ) s = (f l 1) + M C+ (G C ) s = l(l 1) (f l 1) + (iii) M C 3 (G C ) s = f l (i 1) l + 3 (G C ) s = (f l 1) + f i 1 i(i + 1) + f i i(i + 1) + j i (l ); f l (i 1) (l (i 1)) + j i; j i. j i. i=i
13 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 13 Proof. For Type-I graphical embodiment, we have Part (i)(a): Follows from definition of the first chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (i)(b): Follows from definition of the first chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c i c l (i 1). Part (ii)(a): Follows from definition of the second chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (ii)(b): Follows from definition of the second chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c i c l (i 1). Part (iii)(a): Follows from definition of the third chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (iii)(b): Follows from definition of the third chromatic Zagreb index, the Type- I graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c l c 1, c 1 c, c c 3... c l c l 1. For Type-II graphical embodiment, we have Part (i)(a): Follows from definition of the first chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (i)(b): Follows from definition of the first chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c i c l (i 1). Part (ii)(a): Follows from definition of the second chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (ii)(b): Follows from definition of the second chromatic Zagreb index, the Type-II graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c i c l (i 1). Also note that l j i = ( l 1 (i(l i) l i). Part (iii)(a): Follows from definition of the third chromatic Zagreb index, the Type-I graphical embodiment and the fact that θ(c i ) = f l (i 1). Part (iii)(b): Follows from definition of the third chromatic Zagreb index, the Type- II graphical embodiment and the fact that θ(c i ) = f l (i 1) and the mapping c l c 1, c 1 c, c c 3... c l c l 1. Remark 4.. The Fibonacci summation identities f n+1 f n+, fi 3 f i = f l+ f a+1, i=a fi = = f 3l+ + 6( 1) l+1 f l and l fi 4 = f 4l+ + 4( 1) l+1 f l+1 + 6l+3 find partial closure of the results above. These exercises are left for the reader. For useful references see [7, 10, 13].
14 14 Chromatic Zagreb indices for graphical embodiment of colour clusters 5 Conclusion Note that any tree T that allows C as a proper colouring is a construction type, say Type-i. It then follows that any connected subtree T T of order l that has exactly one coloured vertex of each distinct colour in C, can be completed by adding exactly 1 (l 1)(l ) edges to obtain GC. It is important to note that not all constructions types have this property and therefore, cannot yield the graphical embodiment G C. Illustration 5.1. Consider the colour cluster C = ((c 1, c 1, c 1, c 1, c 1, c 1 ), (c, c, c, c ), (c 3, c 3, c 3 ), (c 4, c 4 )). The path v 1,1 v,1 v 1, v, v 1,3 v,3 v 1,4 v,4 v 1,5 v 3,1 v 1,6 v 3, v 4,1 v 3,3 v 4, represents a path-type construction to obtain G p with minimum edges allowing C as a proper colouring. However, a path subgraph that contains colours c 1, c, c 3 cannot also contain colour c 4. Similarly, a path subgraph that contains colours c 1, c 3, c 4 cannot also contain colour c. Finally, path subgraphs that contain either c, c 3, c 4 or c 1, c, c 4 do not exist. Therefore, we need more than 1 (l 1)(l ) additional edges in order to construct G C p. The definitions of minimum and maximum chromatic Zagreb indices are reliant on the premises of a given (fixed) graph construction. This study generalised to two primary variants i.e. graph construction and colour cluster for a given number of distinct colours. Note that the respective C i = r i = θ(c i ) 1, i N. Hence, although this study considered the Type-I and II construction followed by the analysis of chromatic Zagreb indices of both the positive integers and the Fibonacci sequence, the construction type which results in the min{min}, max{min} and the min{max}, max{max} values for the chromatic Zagreb indices Mi C, Mi C+, i = 1,, 3 respectively, remains elusive at this stage. Generally, the results are computationally complex and it is indicative that deeper results will most likely require advanced computer analysis. The application to colour clusters for which the colour weights represent other defined non-negative integer sequences or specialised number sequences opens a wide scope for further research. Finally it is suggested that the Type-II graphical embodiment can be described recursively as the colour cluster extends from C = (C i ), 1 i l to C = (C i ), 1 i l + 1. References [1] H. Abdo, S. Brandt and D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Computer Sci., 16(1)(014), [] M. O. Alberton, The irregularity of a graph, Ars Combin., 46(1997), [3] J. A. Bondy and U. S. R. Murty, Graph theory with applications, Macmillan Press, London, [4] G. Chartrand and L. Lesniak, Graphs and digraphs, CRC Press, (000).
15 Johan Kok, Sudev Naduvath and Muhammad Kamran Jamil 15 [5] G. H. Fath-Tabar, Old and new Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem., 65(011), [6] F. Harary, Graph theory, New Age International, New Delhi, 001. [7] V. C. Harris, On identities involving Fibonacci numbers, Fibonacci Quart., 3(3)(1965), [8] J. Kok, N. K. Sudev and K. P. Chithra, General colouring sums of graphs, Cogent Math., 3(016),1-11, DOI: / [9] J. Kok, N. K. Sudev and U. Mary, On Chromatic Zagreb Indices of Certain Graphs, Discrete Math. Algorithm Appl., to appear. [10] K. Subba Rao, Some properties of Fibonacci numbers, American Mathematical Monthly, 60(1953), [11] N. K. Sudev, K. P. Chithra and J. Kok, Certain chromatic sums of some cycle related graph classes, Discrete Math. Algorithm. Appl., 8(3)(016), 1-4, DOI: /S [1] D. B. West, Introduction to graph theory, Pearson Education Inc., Delhi, 001. [13] D. Zeitlin, On identities for Fibonacci numbers, Am. Math. Monthly, 70(1963),
On the Rainbow Neighbourhood Number of Set-Graphs
On the Rainbow Neighbourhood Number of Set-Graphs Johan Kok, Sudev Naduvath arxiv:1712.02324v1 [math.gm] 6 Dec 2017 Centre for Studies in Discrete Mathematics Vidya Academy of Science & Technology Thalakkottukara,
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 informationA Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
More informationarxiv: v1 [math.gm] 5 Mar 2018
13 Contemp. Stud. Discrete Math., Vol. 2, No. 1, 2018, pp. 13-20 CONTEMPORARY STUDIES IN DISCRETE MATHEMATICS http://www.csdm.org.in ON CHROMATIC CORE SUBGRAPH OF SIMPLE GRAPHS JOHAN KOK 1,, SUDEV NADUVATH
More informationTopological Integer Additive Set-Sequential Graphs. Received: 7 April 2015 / Accepted: 26 June 2015 / Published: 3 July 2015
Mathematics 2015, 3, 604-614; doi:10.3390/math3030604 OPEN ACCESS mathematics ISSN 2227-7390 www.mdpi.com/journal/mathematics Article Topological Integer Additive Set-Sequential Graphs Sudev Naduvath 1,
More informationarxiv: v1 [cs.dm] 22 Jul 2012
The total irregularity of a graph July 4, 0 Hosam Abdo, Darko Dimitrov arxiv:07.567v [cs.dm] Jul 0 Institut für Informatik, Freie Universität Berlin, Takustraße 9, D 495 Berlin, Germany E-mail: [abdo,darko]@mi.fu-berlin.de
More informationZagreb Radio Indices of Graphs
Volume 118 No. 10 018, 343-35 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v118i10.75 ijpam.eu Zagreb Radio Indices of Graphs Joseph Varghese
More informationGraph Algorithms. Chromatic Polynomials. Graph Algorithms
Graph Algorithms Chromatic Polynomials Graph Algorithms Chromatic Polynomials Definition G a simple labelled graph with n vertices and m edges. k a positive integer. P G (k) number of different ways of
More informationMonophonic Chromatic Parameter in a Connected Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 19, 911-920 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.78114 Monophonic Chromatic Parameter in a Connected Graph M.
More informationOn the Wiener Index of Some Edge Deleted Graphs
Iranian Journal of Mathematical Sciences and Informatics Vol. 11, No. (016), pp 139-148 DOI: 10.7508/ijmsi.016.0.011 On the Wiener Index of Some Edge Deleted Graphs B. S. Durgi a,, H. S. Ramane b, P. R.
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 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 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 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 informationS. K. Vaidya and Rakhimol V. Isaac
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(2015), 191-195 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More 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 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 informationA generalization of zero divisor graphs associated to commutative rings
Proc. Indian Acad. Sci. (Math. Sci.) (2018) 128:9 https://doi.org/10.1007/s12044-018-0389-0 A generalization of zero divisor graphs associated to commutative rings M. AFKHAMI 1, A. ERFANIAN 2,, K. KHASHYARMANESH
More 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 informationGRAPHS WITH 1-FACTORS
proceedings of the american mathematical society Volume 42, Number 1, January 1974 GRAPHS WITH 1-FACTORS DAVID P. SUMNER Abstract. In this paper it is shown that if G is a connected graph of order 2n (n>
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 informationOn vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
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 informationEquitable Coloring on Triple Star Graph Families
International J.Math. Combin. Vol.2(2018), 24-32 Equitable Coloring on Triple Star Graph Families K.Praveena (Department of Computer Science, Dr.G.R. Damodaran College of Science, Coimbatore-641014, Tamilnadu,
More informationNetwork flows and Menger s theorem
Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality
More 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 informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationThe Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph
Applied Mathematics E-Notes, 15(2015), 261-275 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph KrishnaPillai
More informationLOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS
LOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS ROMANIAN JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 08, VOLUME 8, ISSUE, p-7 CANAN C IFTC I AND PINAR DU NDAR Abstract A local connective
More informationGap vertex-distinguishing edge colorings of graphs
Gap vertex-distinguishing edge colorings of graphs M. A Tahraoui 1 E. Duchêne H. Kheddouci Université de Lyon, Laboratoire GAMA, Université Lyon 1 43 bd du 11 Novembre 1918, F-696 Villeurbanne Cedex, France
More informationEdge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1
Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1 Arnaud Labourel a a LaBRI - Universite Bordeaux 1, France Abstract In 1974, Kundu [4] has shown that triangulated
More informationSolutions to Exercises 9
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 9 (1) There are 5 cities. The cost of building a road directly between i and j is the entry a i,j in the matrix below. An indefinite entry indicates
More informationOn the extending of k-regular graphs and their strong defining spectrum
On the extending of k-regular graphs and their strong defining spectrum Doost Ali Mojdeh Department of Mathematics University of Mazandaran P. O. Box 47416-1467 Babolsar Iran Abstract In a given graph
More 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 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 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 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 informationON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 017 (137 144) 137 ON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS Xianya Geng Zhixiang Yin Xianwen Fang Department of Mathematics and Physics
More informationF-INDEX AND COINDEX OF SOME DERIVED GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 81-88 DOI: 10.7251/BIMVI1801081D Former BULLETIN OF
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 informationThe competition numbers of complete tripartite graphs
The competition numbers of complete tripartite graphs SUH-RYUNG KIM Department of Mathematics Education, Seoul National University, 151-742, Korea srkim@snuackr YOSHIO SANO Research Institute for Mathematical
More informationAMO - Advanced Modeling and Optimization, Volume 16, Number 2, 2014 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS
AMO - Advanced Modeling and Optimization, Volume 6, Number, 4 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS S K Vaidya Department of Mathematics, Saurashtra University, Rajkot-6 5, GUJARAT (INDIA).
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
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 informationEccentric Coloring of a Graph
Eccentric Coloring of a Graph Medha Itagi Huilgol 1 & Syed Asif Ulla S. 1 Journal of Mathematics Research; Vol. 7, No. 1; 2015 ISSN 1916-9795 E-ISSN 1916-909 Published by Canadian Center of Science and
More informationTopological Invariance under Line Graph Transformations
Symmetry 2012, 4, 329-335; doi:103390/sym4020329 Article OPEN ACCESS symmetry ISSN 2073-8994 wwwmdpicom/journal/symmetry Topological Invariance under Line Graph Transformations Allen D Parks Electromagnetic
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 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 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 informationarxiv: v1 [math.co] 4 Apr 2011
arxiv:1104.0510v1 [math.co] 4 Apr 2011 Minimal non-extensible precolorings and implicit-relations José Antonio Martín H. Abstract. In this paper I study a variant of the general vertex coloring problem
More informationarxiv: v1 [math.co] 30 Nov 2015
On connected degree sequences arxiv:1511.09321v1 [math.co] 30 Nov 2015 Jonathan McLaughlin Department of Mathematics, St. Patrick s College, Dublin City University, Dublin 9, Ireland Abstract This note
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 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 informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
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 informationPacking Chromatic Number of Distance Graphs
Packing Chromatic Number of Distance Graphs Jan Ekstein Premysl Holub Bernard Lidicky y May 25, 2011 Abstract The packing chromatic number (G) of a graph G is the smallest integer k such that vertices
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More 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 informationColoring edges and vertices of graphs without short or long cycles
Coloring edges and vertices of graphs without short or long cycles Marcin Kamiński and Vadim Lozin Abstract Vertex and edge colorability are two graph problems that are NPhard in general. We show that
More informationBounds on distances for spanning trees of graphs. Mr Mthobisi Luca Ntuli
Bounds on distances for spanning trees of graphs Mr Mthobisi Luca Ntuli March 8, 2018 To Mphemba Legacy iii Acknowledgments I would like to thank my supervisors, Dr MJ Morgan and Prof S Mukwembi. It
More informationPAijpam.eu TOTAL CO-INDEPENDENT DOMINATION OF JUMP GRAPH
International Journal of Pure and Applied Mathematics Volume 110 No. 1 2016, 43-48 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v110i1.4
More informationDivisor cordial labeling in context of ring sum of graphs
International Journal of Mathematics and Soft Computing Vol.7, No.1 (2017), 23-31. ISSN Print : 2249-3328 ISSN Online : 2319-5215 Divisor cordial labeling in context of ring sum of graphs G. V. Ghodasara
More 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 informationStrong Triple Connected Domination Number of a Graph
Strong Triple Connected Domination Number of a Graph 1, G. Mahadevan, 2, V. G. Bhagavathi Ammal, 3, Selvam Avadayappan, 4, T. Subramanian 1,4 Dept. of Mathematics, Anna University : Tirunelveli Region,
More informationCOLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES
Volume 2, Number 1, Pages 61 66 ISSN 1715-0868 COLORING EDGES AND VERTICES OF GRAPHS WITHOUT SHORT OR LONG CYCLES MARCIN KAMIŃSKI AND VADIM LOZIN Abstract. Vertex and edge colorability are two graph problems
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationMean, Odd Sequential and Triangular Sum Graphs
Circulation in Computer Science Vol.2, No.4, pp: (40-52), May 2017 https://doi.org/10.22632/ccs-2017-252-08 Mean, Odd Sequential and Triangular Sum Graphs M. A. Seoud Department of Mathematics, Faculty
More informationON VERTEX b-critical TREES. Mostafa Blidia, Noureddine Ikhlef Eschouf, and Frédéric Maffray
Opuscula Math. 33, no. 1 (2013), 19 28 http://dx.doi.org/10.7494/opmath.2013.33.1.19 Opuscula Mathematica ON VERTEX b-critical TREES Mostafa Blidia, Noureddine Ikhlef Eschouf, and Frédéric Maffray Communicated
More informationDegree Equitable Domination Number and Independent Domination Number of a Graph
Degree Equitable Domination Number and Independent Domination Number of a Graph A.Nellai Murugan 1, G.Victor Emmanuel 2 Assoc. Prof. of Mathematics, V.O. Chidambaram College, Thuthukudi-628 008, Tamilnadu,
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 informationRadio Number for Special Family of Graphs with Diameter 2, 3 and 4
MATEMATIKA, 2015, Volume 31, Number 2, 121 126 c UTM Centre for Industrial and Applied Mathematics Radio Number for Special Family of Graphs with Diameter 2, 3 and 4 Murugan Muthali School of Science,
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
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 informationTriple Connected Complementary Tree Domination Number Of A Graph V. Murugan et al.,
International Journal of Power Control Signal and Computation (IJPCSC) Vol.5 No. 2,2013-Pp:48-57 gopalax journals,singapore ISSN:0976-268X Paper Received :04-03-2013 Paper Published:14-04-2013 Paper Reviewed
More informationSpanning eulerian subgraphs in N 2 -locally connected claw-free graphs
Spanning eulerian subgraphs in N 2 -locally connected claw-free graphs Hong-Jian Lai, Mingchu Li, Yehong Shao and Liming Xiong July 15, 2005 Abstract A graph G is N m -locally connected if for every vertex
More informationPrime Labeling For Some Octopus Related Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 6 Ver. III (Nov. - Dec.2016), PP 57-64 www.iosrjournals.org Prime Labeling For Some Octopus Related Graphs A.
More informationEfficient Triple Connected Domination Number of a Graph
International Journal of Computational Engineering Research Vol, 03 Issue, 6 Efficient Triple Connected Domination Number of a Graph G. Mahadevan 1 N. Ramesh 2 Selvam Avadayappan 3 T. Subramanian 4 1 Dept.
More 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 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 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 informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationAverage D-distance Between Edges of a Graph
Indian Journal of Science and Technology, Vol 8(), 5 56, January 05 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 OI : 07485/ijst/05/v8i/58066 Average -distance Between Edges of a Graph Reddy Babu
More informationDOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT
Discussiones Mathematicae Graph Theory 38 (2018) 203 215 doi:10.7151/dmgt.2002 DOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT Wyatt J. Desormeaux 1, Teresa W. Haynes 1,2 and Michael A. Henning 1 1
More informationOn the Sum and Product of Covering Numbers of Graphs and their Line Graphs
Communications in Mathematics Applications Vol. 6, No. 1, pp. 9 16, 015 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com On the Sum Product of Covering
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 informationarxiv: v4 [math.co] 4 Apr 2011
Upper-critical graphs (complete k-partite graphs) José Antonio Martín H. Faculty of Computer Science, Complutense University of Madrid, Spain arxiv:1011.4124v4 [math.co] 4 Apr 2011 Abstract This work introduces
More 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 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 informationStrong and Semi Strong Outer Mod Sum Graphs
Int. Journal of Math. Analysis, Vol. 7, 013, no., 73-83 Strong and Semi Strong Outer Mod Sum Graphs M. Jayalakshmi and B. Sooryanarayana Dept.of Mathematical and Computational Studies Dr.Ambedkar Institute
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 informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Stephan Dominique Andres: Game-perfect digraphs paths and cycles Technical Report feu-dmo015.09 Contact: dominique.andres@fernuni-hagen.de FernUniversität in Hagen Fakultät
More informationMAXIMUM WIENER INDEX OF TREES WITH GIVEN SEGMENT SEQUENCE
MAXIMUM WIENER INDEX OF TREES WITH GIVEN SEGMENT SEQUENCE ERIC OULD DADAH ANDRIANTIANA, STEPHAN WAGNER, AND HUA WANG Abstract. A segment of a tree is a path whose ends are branching vertices (vertices
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationVertex-Mean Graphs. A.Lourdusamy. (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan
International J.Math. Combin. Vol. (0), -0 Vertex-Mean Graphs A.Lourdusamy (St.Xavier s College (Autonomous), Palayamkottai, India) M.Seenivasan (Sri Paramakalyani College, Alwarkurichi-67, India) E-mail:
More informationA DISCUSSION ON SSP STRUCTURE OF PAN, HELM AND CROWN GRAPHS
VOL. 10, NO. 9, MAY 015 ISSN 1819-6608 A DISCUSSION ON SSP STRUCTURE OF PAN, HELM AND CROWN GRAPHS R. Mary Jeya Jothi Department of Mathematics, Sathyabama University, Chennai, India E-Mail: jeyajothi31@gmail.com
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 informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
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 informationMajority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
More information