Complete Cototal Domination
|
|
- Berniece Cummings
- 5 years ago
- Views:
Transcription
1 Chapter 5 Complete Cototal Domination Number of a Graph Published in Journal of Scientific Research Vol. () (2011), (Bangladesh). 64
2 ABSTRACT Let G = (V,E) be a graph. A dominating set D V is said to be complete cototal dominating set if every vertex in V is adjacent to some vertex in D and there exists a vertex u D and v V D such that uv E(G) and N(v) u = x V D. The completecototaldomination number γ cc (G) of G is the minimum cardinality of a complete cototal dominating set of G. In this chapter, we initiate the study of complete cototal domination in graphs and present bounds and some exact values for γ cc (G). Also its relationship with other domination parameters are established and related two open problems are explored. 65
3 5.1 Introduction The graphs considered in this chapter are simple and without isolated vertices. A vertex v V is called a pendant vertex, if deg G (v) = 1 and an isolated vertex if deg G (v) = 0, where d(g) = deg G (x) is the degree of a vertex x V(G). A vertex which is adjacent to a pendant vertex is called a support vertex. A dominating set D V of a graph G = (V,E) is called a connected dominating set if the induced subgraph D is connected. The connected domination number γ c (G) of G is the minimum cardinality of a connected dominating set of G [59]. A set D V of a graph G = (V,E) is called a total dominating set if the induced subgraph D has no isolated vertices. The total domination number γ t (G) of G is the minimum cardinality of a total dominating set of G [22]. A dominatingset D issaidtobe a cototaldominatingset if the induced subgraph V D has no isolated vertices. The cototal domination number γ cl (G) of G is the minimum cardinalityof a cototaldominating set of G [44]. 66
4 Complete Cototal Domination Number of a Graph Inspired from the cototal domination, we introduce the new parameter in the field of domination theory of graphs as follows. Definition 5.1. Let G = (V,E) be a graph. A dominatingset D V is saidtobe completecototaldominatingset ifeveryvertexin V isadjacent to some vertex in D and there exists a vertex u D and v V D such that uv E(G) and N(v) u = x V D. The complete cototal domination number γ cc (G) of G is the minimum cardinality of a complete cototal dominating set of G. For illustration, consider a graph in Figure G : Figure 5.1 In Figure 5.1, the set {1,2,} is a dominatingset as well as cototal dominating set, and set {4,5,6} is a total dominating set. However, any com- 67
5 plete cototal dominating set must include each pendant vertex {1, 2, } and its neighbor {4,5,6}. Thus γ cc (G) = {1,2,,4,5,6}= V = p. Applications Many applications of domination in graphs can be extended to complete cototal domination. For example, if we think of each vertex in a dominating set as file server for a computer network, then each computer in the network has direct access to a file server. It is sometimes reasonable to assume that this access be available even when one of the file servers goes down. A complete cototal dominating set provides the desired fault tolerance for such cases because each computer has access to at least two file servers and each file server has direct access to one backup server and each backup file server has direct access to at least one backup file server. 5.2 Results Obviously, a graph with an isolated vertex cannot have a complete cototal dominating set. We ask the natural question regarding the existence of complete cototal dominating sets. 68
6 Theorem 5.1 Every graph with no isolated vertices has a complete cototal dominating set and hence a complete cototal domination number. Proof. Without loss of generality, let G = (V,E) be connected. Then V itself is a complete cototal dominating set as each vertex is considered to dominateitself,andsince G hasnoisolates, G isnontrivialsoeachvertex v isadjacenttosomeothervertex u. Thusboth u and v dominate v and if V D has no isolated vertices. Now that we know G has a complete cototaldominatingset, wemayremoveonevertexatatimefrom V ifand only if the remaining subset of V is still a complete cototal dominating set. This will give a minimal complete cototal dominating set. Among all the complete cototal dominating sets, each of the smallest sets has cardinality γ cc (G). Henceforth we consider only graphs with no isolated vertices. First, we calculate complete cototal domination in specific families of graphs. Theorem 5.2 (i) For any path P p, γ cc (P p ) = p 2 p 2 4. (ii) For any cycle C p, γ cc (C p ) = p 2 p 4. (iii) For any star K 1,p 1, γ cc (K 1,p 1 ) = p. 69
7 (iv) For any wheel W p, γ cc (W p ) = 2. (v) For any complete graph K p, γ cc (K p ) = p if p = 2, 2 otherwise. Next, we state straightforward upper and lower bounds for γ cc (G). Theorem 5. Let G be a graph with no isolated vertices. Then 2 γ cc (G) p, and these bounds are sharp. Further, equality of an upper bound holds if and only if every edge of G is incident to a support vertex or G = C. Proof. Clearly from the definition of γ cc (G) and by Theorem 5.2, the result follows. Now for the equality of an upper bound, if p = 2 or then the result is obvious. Let us assume that p 4. Let D be the complete cototal dominating set of G. Then clearly D contains all the pendant vertices and support vertices of a graph G. Also no two vertices of V D are adjacent, which implies that D = p is a minimum complete cototal dominating set of G. Suppose every edge of G is not incident to a support vertex or G = C, 70
8 then there exists an edge uv where neither u nor v is a support vertex and deg(u) 2 and deg(v) 2. Let D = V {u,v}. Obviously D is a dominating set and V D is connected. If D contains no isolated vertices, then D is a complete cototal dominating set of G of cardinality p 2, a contradiction. Theorem 5.4 Let G = T be any nontrivial tree. Then 1+Δ(G) γ cc (G). Further equality holds if and only if G = K 1,p 1. Proof. Let G = T beanynontrivialtreeandlet D be acompletecototal dominating set of T. Clearly D contains all the pendant vertices and support vertices of a tree. Therefore, γ cc (T) 1+Δ(T). For equality, if T = K 1,p 1 then by result (iii) of Theorem 5.2, the result follows. Conversely, let T be a tree with γ cc (T) = 1 + Δ(T). Let D be a complete cototal dominating set with size D = 1+Δ(T) and let v be a maximum degree vertex in T. If v / D, then D 2Δ(T) which is impossible,so v D. Nowitfollowsfrom D = 1+Δ(T) that N(v) T and any vertex of N(v) is a pendant vertex. Hence D = K 1,p 1. Next theorem gives the upper bound for γ cc (G) in terms of order and 71
9 size. Theorem 5.5 Let G = (p, q) be any nontrivial connected graph. Then γ cc (G) 2q p+2. Further, equality holds if and only if G = T is tree and every edge of a tree is incident with a support vertex. Proof. Obviously, γ cc (G) p = 2(p 1) p+2 andsince G isconnected, q p 1. Thus γ cc (G) 2q p+2 if and only if every edge of a tree is incidentwithasupportvertex,then q = p 1 and γ cc (G) = p = 2q p+2. Conversely, let γ cc (G) = 2q p+2. Then 2q p+2 p, which implies that q p 1, so G is a tree with γ cc (G) = p and by Theorem 5., the result follows. Next, we give the upper bound for γ cc (G) in terms of order and minimum degree. Theorem 5.6 Let G be any connected graph of order at least four and 2 δ(g) p 1. Then γ cc (G) p δ(g). The next theorem relates γ cc (G) with maximum number of independent edges β 1 (G) of G. Theorem 5.7 If G has δ(g) 2, then γ cc (G) 2β 1 (G). 72
10 Proof. Let G be a graph with δ(g) 2 and M be a maximum independent set of edges in G. Let S M be the total dominating set of G. Since each v V S must have at least one neighbor in V S. So S is a complete cototal dominating set of G. Hence γ cc (G) 2β 1 (G). Theorem 5.A[27]. For any graph G without isolated vertices, γ(g) p Δ(G)+1. Relates the domination number to the maximum degree. We establish a similar result for γ cc (G). Theorem 5.8 For any graph G, without isolated vertices, 2p Δ(G)+1 γ cc(g) Proof. Let G have no isolated vertices and let S be a γ cc set for G. Let t denote the number of edges in G having one vertex in S and the other vertex in V S. Since Δ(G) deg(v) for all v S and each vertex in S is adjacent to at least one member of S, we have, t (Δ(G) 1) S = (Δ(G) 1)γ cc (G). Also each vertex in V S is adjacent to at least one vertex of V S, we have, t 2 V S = 2[p γ cc (G)]. 7
11 Hance, 2(p γ cc (G)) Δ(G)γ cc (G) γ cc (G). Whichreducestothebound of the theorem. Theorem 5.9 For any tree T = K 1,p 1 with with p 6, then γ cc (T) 2p. Next, we constructively characterize the tree for which γ cc (T) = 2p. We define the following operations on trees which achieve the lower bound of the Theorem 5.9. Operation 5.1. Attach P to a vertex v, where v is neither a pendant vertex nor a support vertex and N(v) has a support vertex of degree two in T. Operation 5.2. Attach P 1 to a vertex v, where v is either a pendant vertex or a support vertex of T. Operation 5.. Attach P 2 to any vertex of T. Let, X 0 = {T/T is a tree obtained from P 6 by finite type of operations 5.1}. X 1 = {T/Tis obtained from a tree T X 0 by applying operation 5.2 to T }. X 2 = {T/T is a tree which can be obtained from a tree T X by applying operation 5.}. Let, τ n = {T/Tis a tree of order p such that γ cc (T) = 2p }. 74
12 Proposition 5.1. If T X 0 has order p 6, then D(T) = P(T) S(T) is a complete cototal dominating set of cardinality 2p. Where D(T) is the union of set of all pendant vertices P(T) and the support vertices S(T) of a tree T. Proof. We use induction on k, the number of steps required to construct T. If k = 0, then T = P 6, and D(T) is a complete cototal dominating set of cardinality 4, i.e. 2p = 2 6 = 4. Suppose T can be constructed from P 6 by a sequence of k 1 operations 5.1, and suppose that T is a tree which can be obtained from P 6 by k 1 operations of type 1, then let D(T ) is a complete cototal dominating set of cardinality 2p(T ). As T X 0, T can be obtained from T by applying operation type 1. By induction assumption D(T ) = P(T ) S(T ) is a complete cototal dominating set of cardinality 2p(T ). Therefore, D(T ) {v 1,v 2 } = D(T) is a complete cototal dominating set of cardinality 2p(T). Proposition 5.2. Let T τ and v is a pendant vertex of T. If D {v} is a complete cototaldominatingset of T v, then the number of vertices in a tree is not a multiple of and T v τ. Proof. Suppose v is a pendant vertex of a tree T, and D {v} is a complete cototal dominating set of T {v}. Note that 75
13 2(p 1) γ cc (T v) 2p 1. If the number of vertices in a tree T is a multiple of three, i.e. p = k for some positive integer k 1, then we have 2(k 1) 2(k) 1, and so, 2k 2k 1, which is impossible. Thus p = k+1 or p = k+2 for some positive integer k 1. If p = k + 1, then 2(k) γ cc (T v) 2(k+1) 1, which implies that, 2k γ cc (T v) 2k and so T v τ. If p = k +2, then 2(k+1) γ cc (T v) 2(k+2) 1, which implies 2k +1 γ cc (T v) 2k +1 and so T v τ. Proposition 5.. Let T τ and suppose v 1 and v 2 are either both pendant vertices of T or v 1 is degree two support vertex of T adjacent to a pendant vertex v 2. If D {v 1,v 2 } is a complete cototal dominating set of T v 1 v 2, then T v 1 v 2 τ and the number of vertices in a tree minus two is a multiple of three. Proof. Suppose v 1 and v 2 are either pendant vertices of a tree T or v 1 is a degree two support vertex of T adjacent to a pendant vertex v 2 and that D {v 1,v 2 } is a complete cototal dominating set of T v 1 v 2. Note that 76
14 2(p 2) γ cc (T v 1 v 2 ) 2p 2. Suppose either p = k or p = k +1 for some positive integer k 1. If p = k, then 2(k 2) 2(k) 2, and so 2k 1 2k 2, which is impossible. If p = k+1, then 2(k 1) 2(k+1) 2, and so, 2k 2k 1, which is impossible. Thus, p = k+2. Hence p = k+2 for some positive integer k, and so 2(k) 2(k+2) 2. Hence, 2k γ cc (T v 1 v 2 ) 2k and so T v 1 v 2 τ. Now we are ready to prove the following theorem. Theorem 5.10 For any tree T = K 1,p 1 with p 6, τ = 2 i=0 X i. Proof. Suppose T X 0. If T = P 6, then γ cc (T) = 4 = 2p(T). If T is not P 6 then by Proposition 5.1, γ cc (T) = 2p(T) and so T τ. Suppose T X 1. Then p = p(t) = k + 1 for some positive integer k, and T can be constructed from T X 0 by applying operation 5.2 to T. Let u be the P 1 attached. By Proposition 5.1, D(T ) is a complete cototal dominating set of cardinality 2k. But then D {u} is a complete cototal dominating set of T of cardinality 2k + 1. Therefore, γ cc (T) 2(k+1) = 2k +1 and so γ cc (T) = 2p. Hence T τ. 77
15 Suppose T X 2, then p = p(t) = k + 2 for some positive integer k, and T can be constructed from T X 0 by applying operation 5.. Let u and u be the added vertices. By Proposition 5.1, D(T ) is a complete cototal dominating set of cardinality 2k. But then D {u,u } is a complete cototal dominating set of T of cardinality 2k +2. Therefore γ cc (T) 2(k+2) = 2k +2, and so γ cc (T) = 2p. Hence T τ. We now show that τ 2 i=0 X i. To prove this we apply induction on the number of vertices p of the tree T τ. If p = 6, then T = P 6 X 0. Suppose T τ has order p = p(t) 1 and assume that T is a tree with 6 p(t ) < p and T τ. Then T 2 i=0 X i. Let D be any complete cototal dominating set. Then each vertex in V D is adjacent to at least one vertex in D. Furthermore, every vertex in D is either a degree two support vertex adjacent to exactly one vertex in V D or a pendant vertex adjacent to degree two support vertex that is adjacent to exactly one vertex in V D. Hence the number of vertices in a tree is the multiples of three and p = k for some positive integer k 2. Let v be the end point of the diametrical path v = v 1,v 2,,v i in V D. As T contains no cycles, v is a pendant vertex of V D. Thus deg(v) = 2 78
16 and V D 2, and so v 2 is adjacent to a degree two support vertex. If V D = 2, then T = P 6 X 0. We therefore assume that V D. Note that v 2 is neither a pendant vertex nor a support vertex of T = T v 1 u 0 u 1. Moreover, D {u 0,u 1 } is a complete cototal dominating set of T and so 2(k ) γ cc (T ) 2(k) 2, which implies that 2k 2 γ cc (T ) 2k 2 and so T τ. By our induction assumption T X 0. Hence T X 0. Next, we have the following characterization of graphs for which the complete cototal domination number is equal to the total domination number. Theorem 5.11 For any graph G, γ cc (G) = γ t (G) if and only if G has a total dominating set D such that V D has no isolated vertices. In the next theorem we prove the relation between connected domination number and complete cototal domination number. Theorem 5.12 If Δ(G) = p 1, then γ cc (G) 1+γ c (G). Proof. If Δ(G) = p 1. Then clearly, γ c (G) = 1. By the definition of complete cototaldominationand by Theorem 5., γ cc (G) 2. Therefore, clearly γ cc (G) γ c (G)+1. 79
17 Next theorem gives the relation between cototal domination number and the complete cototal domination number. Theorem 5.1 For any graph G, a cototal dominating set D is said to be a complete cototal dominating set of G if D has no isolated vertices. Next, we obtain Nordhaus-Gaddum type results for complete cototal domination number of G. Theorem 5.14 Let G be any nontrivial connected graph. If both G and G has no isolated vertices, then (i) γ cc (G)+γ cc (G) 2p (ii) γ cc (G) γ cc (G) p 2. Further, equality holds for G = P 4 or C 5. Finally, we conclude this chapter by exploring the following two open problems for the further research on this topic. Open Problem 5.1. Characterize the graphs for which γ cc (G) = γ cl (G). Open Problem 5.2. Characterize the graphs for which γ cc (G) = 1+γ c (G). 80
Chromatic 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 informationRainbow game domination subdivision number of a graph
Rainbow game domination subdivision number of a graph J. Amjadi Department of Mathematics Azarbaijan Shahid Madani University Tabriz, I.R. Iran j-amjadi@azaruniv.edu Abstract The rainbow game domination
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 informationOn Independent Equitable Cototal Dominating set of graph
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X Volume 12, Issue 6 Ver V (Nov - Dec2016), PP 62-66 wwwiosrjournalsorg On Independent Equitable Cototal Dominating set of graph
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 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 informationRoman Domination in Complementary Prism Graphs
International J.Math. Combin. Vol.2(2012), 24-31 Roman Domination in Complementary Prism Graphs B.Chaluvaraju and V.Chaitra 1(Department of Mathematics, Bangalore University, Central College Campus, Bangalore
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 informationGraph Theory Day Four
Graph Theory Day Four February 8, 018 1 Connected Recall from last class, we discussed methods for proving a graph was connected. Our two methods were 1) Based on the definition, given any u, v V(G), there
More informationTHE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction
MATEMATIQKI VESNIK 67, 2 (2015), 102 114 June 2015 originalni nauqni rad research paper THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS N. Dehgardi, S. M. Sheikholeslami and L. Volkmann Abstract.
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More 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 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 informationTHE CONNECTED COMPLEMENT DOMINATION IN GRAPHS V.MOHANASELVI 1. Assistant Professor of Mathematics, Nehru Memorial College, Puthanampatti,
THE CONNECTED COMPLEMENT DOMINATION IN GRAPHS V.MOHANASELVI 1 Assistant Professor of Mathematics, Nehru Memorial College, Puthanampatti, Tiruchirappalli-621 00 S.DHIVYAKANNU 2 Assistant Professor of Mathematics,
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 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 informationOn the packing numbers in graphs arxiv: v1 [math.co] 26 Jul 2017
On the packing numbers in graphs arxiv:1707.08656v1 [math.co] 26 Jul 2017 Doost Ali Mojdeh and Babak Samadi Department of Mathematics University of Mazandaran, Babolsar, Iran damojdeh@umz.ac.ir samadibabak62@gmail.com
More informationPAIRED-DOMINATION. S. Fitzpatrick. Dalhousie University, Halifax, Canada, B3H 3J5. and B. Hartnell. Saint Mary s University, Halifax, Canada, B3H 3C3
Discussiones Mathematicae Graph Theory 18 (1998 ) 63 72 PAIRED-DOMINATION S. Fitzpatrick Dalhousie University, Halifax, Canada, B3H 3J5 and B. Hartnell Saint Mary s University, Halifax, Canada, B3H 3C3
More informationChapter-0: Introduction. Chapter 0 INTRODUCTION
Chapter 0 INTRODUCTION 1 Graph Theory is a branch of Mathematics which has become quite rich and interesting for several reasons. In last three decades hundreds of research article have been published
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 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 informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More 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 informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
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 informationDouble Domination Edge Critical Graphs.
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2006 Double Domination Edge Critical Graphs. Derrick Wayne Thacker East Tennessee
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 informationDomination Number of Jump Graph
International Mathematical Forum, Vol. 8, 013, no. 16, 753-758 HIKARI Ltd, www.m-hikari.com Domination Number of Jump Graph Y. B. Maralabhavi Department of Mathematics Bangalore University Bangalore-560001,
More informationDomination in Jahangir Graph J 2,m
Int. J. Contemp. Math. Sciences, Vol., 007, no. 4, 119-1199 Domination in Jahangir Graph J,m D. A. Mojdeh and A. N. Ghameshlou Department of Mathematics University of Mazandaran P.O. Box 47416-1467, Babolsar,
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 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 informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationExcellent graphs Preethi Kuttipulackal Mixed Tree Domination in Graphs Thesis. Department of Mathematics, University of Calicut, 2012
Excellent graphs Preethi Kuttipulackal Mixed Tree Domination in Graphs Thesis. Department of Mathematics, University of Calicut, 2012 CHAPTER 5 Excellent graphs 5.1 Introduction The main difficulty in
More informationNote: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
Note: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination Peter Dankelmann a Michael A. Henning b Wayne Goddard c Renu Laskar d a School of Mathematical Sciences, University of
More informationThe Dual Neighborhood Number of a Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 47, 2327-2334 The Dual Neighborhood Number of a Graph B. Chaluvaraju 1, V. Lokesha 2 and C. Nandeesh Kumar 1 1 Department of Mathematics Central College
More informationMath 575 Exam 3. (t). What is the chromatic number of G?
Math 575 Exam 3 Name 1 (a) Draw the Grötsch graph See your notes (b) Suppose that G is a graph having 6 vertices and 9 edges and that the chromatic polynomial of G is given below Fill in the missing coefficients
More informationA NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH
A NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH STEPHAN WAGNER Abstract. In a recent article by Bród and Skupień, sharp upper and lower bounds for the number of dominating sets in a tree were determined.
More 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 information8.2 Paths and Cycles
8.2 Paths and Cycles Degree a b c d e f Definition The degree of a vertex is the number of edges incident to it. A loop contributes 2 to the degree of the vertex. (G) is the maximum degree of G. δ(g) is
More informationOuter-2-independent domination in graphs
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 126, No. 1, February 2016, pp. 11 20. c Indian Academy of Sciences Outer-2-independent domination in graphs MARCIN KRZYWKOWSKI 1,2,, DOOST ALI MOJDEH 3 and MARYEM
More informationTHE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(1)(2017), 23-30 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationGlobal Alliance Partition in Trees
Global Alliance Partition in Trees Linda Eroh Department of Mathematics University of Wisconsin Oshkosh, Oshkosh, WI, 54901 eroh@uwoshedu and Ralucca Gera Department of Applied Mathematics Naval Postgraduate
More informationSkew propagation time
Graduate Theses and Dissertations Graduate College 015 Skew propagation time Nicole F. Kingsley Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/etd Part of the Applied
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 informationINDEPENDENT MIDDLE DOMINATION NUMBER IN JUMP GRAPH
INDEPENDENT MIDDLE DOMINATION NUMBER IN JUMP GRAPH N. Prtap Babu Rao 1 1Department of Mathematics veerashiva college Ballari (Karnataka) INDIA ---------------------------------------------------------------------------***---------------------------------------------------------------------------
More informationMatching and Factor-Critical Property in 3-Dominating-Critical Graphs
Matching and Factor-Critical Property in 3-Dominating-Critical Graphs Tao Wang a,, Qinglin Yu a,b a Center for Combinatorics, LPMC Nankai University, Tianjin, China b Department of Mathematics and Statistics
More 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 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 informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationOn total domination and support vertices of a tree
On total domination and support vertices of a tree Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper and Bill Waller University of Houston-Downtown, Houston, Texas 7700 delavinae@uhd.edu, pepperr@uhd.edu,
More informationComplementary nil vertex edge dominating sets
Proyecciones Journal of Mathematics Vol. 34, N o 1, pp. 1-13, March 2015. Universidad Católica del Norte Antofagasta - Chile Complementary nil vertex edge dominating sets S. V. Siva Rama Raju Ibra College
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More 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 informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationOn t-restricted Optimal Rubbling of Graphs
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2017 On t-restricted Optimal Rubbling of Graphs Kyle Murphy East Tennessee State
More informationDEFINITION OF GRAPH GRAPH THEORY GRAPHS ACCORDING TO THEIR VERTICES AND EDGES EXAMPLE GRAPHS ACCORDING TO THEIR VERTICES AND EDGES
DEFINITION OF GRAPH GRAPH THEORY Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each
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 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 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 informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More informationWe need the following Theorems for our further results: MAIN RESULTS
International Journal of Technical Research Applications e-issn: 2320-8163, SPLIT BLOCK SUBDIVISION DOMINATION IN GRAPHS MH Muddebihal 1, PShekanna 2, Shabbir Ahmed 3 Department of Mathematics, Gulbarga
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More 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 informationSome Properties of Glue Graph
Annals of Pure and Applied Mathematics Vol. 6, No. 1, 2014, 98-103 ISSN: 2279-087X (P), 2279-0888(online) Published on 23 May 2014 www.researchmathsci.org Annals of V.S.Shigehalli 1 and G.V.Uppin 2 1 Department
More informationDomination Cover Pebbling: Structural Results
Domination Cover Pebbling: Structural Results arxiv:math.co/0509564 v 3 Sep 005 Nathaniel G. Watson Department of Mathematics Washington University at St. Louis Carl R. Yerger Department of Mathematics
More informationEccentric domination in splitting graph of some graphs
Advances in Theoretical and Applied Mathematics ISSN 0973-4554 Volume 11, Number 2 (2016), pp. 179-188 Research India Publications http://www.ripublication.com Eccentric domination in splitting graph of
More informationAdvanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.
18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we
More informationTREES WITH UNIQUE MINIMUM DOMINATING SETS
TREES WITH UNIQUE MINIMUM DOMINATING SETS Sharada B Department of Studies in Computer Science, University of Mysore, Manasagangothri, Mysore ABSTRACT A set D of vertices of a graph G is a dominating set
More informationInternational Journal of Mathematical Archive-6(10), 2015, Available online through ISSN
International Journal of Mathematical Archive-6(10), 2015, 70-75 Available online through www.ijma.info ISSN 2229 5046 STRONG NONSPLIT LINE SET DOMINATING NUMBER OF GRAPH P. SOLAI RANI* 1, Mrs. R. POOVAZHAKI
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 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 informationInverse Accurate Independent Domination In Fuzzy Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 2 Ver. I (Mar. - Apr. 2016), PP 36-40 www.iosrjournals.org Inverse Accurate Independent Domination In Fuzzy
More informationPerfect k-domination in graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 175 184 Perfect k-domination in graphs B. Chaluvaraju Department of Mathematics Bangalore University Central College Campus, Bangalore 560
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More informationCHARACTERIZING SYMMETRIC DIAMETRICAL GRAPHS OF ORDER 12 AND DIAMETER 4
IJMMS 30:3 (2002) 145 149 PII. S0161171202012474 http://ijmms.hindawi.com Hindawi Publishing Corp. CHARACTERIZING SYMMETRIC DIAMETRICAL GRAPHS OF ORDER 12 AND DIAMETER 4 S. AL-ADDASI and H. Al-EZEH Received
More informationBounds on the signed domination number of a graph.
Bounds on the signed domination number of a graph. Ruth Haas and Thomas B. Wexler September 7, 00 Abstract Let G = (V, E) be a simple graph on vertex set V and define a function f : V {, }. The function
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 informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationA Vizing-like theorem for union vertex-distinguishing edge coloring
A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau Abstract We introduce a variant of the vertex-distinguishing
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationEFFICIENT BONDAGE NUMBER OF A JUMP GRAPH
EFFICIENT BONDAGE NUMBER OF A JUMP GRAPH N. Pratap Babu Rao Associate Professor S.G. College Koppal(Karnataka), INDIA --------------------------------------------------------------------------------***------------------------------------------------------------------------------
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 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 informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationGlobal Triple Connected Domination Number of A Graph
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 5 Ver. IV (Sep. - Oct.2016), PP 62-70 www.iosrjournals.org Global Triple Connected Domination Number of A Graph
More information(5.2) 151 Math Exercises. Graph Terminology and Special Types of Graphs. Malek Zein AL-Abidin
King Saud University College of Science Department of Mathematics 151 Math Exercises (5.2) Graph Terminology and Special Types of Graphs Malek Zein AL-Abidin ه Basic Terminology First, we give some terminology
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 informationIntersection Graph on Non-Split Majority Dominating Graph
Malaya J. Mat. S()(015) 476 480 Intersection Grah on Non-Slit Majority Dominating Grah J. Joseline Manora a and S. Veeramanikandan b, a,b PG and Research Deartment of Mathematics, T.B.M.L College, Porayar,
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 informationIndependence Number and Cut-Vertices
Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence
More informationGeneral Bounds on the Downhill Domination Number in Graphs.
East Tennessee State University Digital Commons @ East Tennessee State University Undergraduate Honors Theses 5-2013 General Bounds on the Downhill Domination Number in Graphs. William Jamieson East Tennessee
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 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 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 informationFURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION
FURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION HAILONG DAO AND JAY SCHWEIG Abstract. We study the relationship between the projective dimension of a squarefree monomial ideal
More informationTHE INSULATION SEQUENCE OF A GRAPH
THE INSULATION SEQUENCE OF A GRAPH ELENA GRIGORESCU Abstract. In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and
More informationLet G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.
Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,
More informationSome Elementary Lower Bounds on the Matching Number of Bipartite Graphs
Some Elementary Lower Bounds on the Matching Number of Bipartite Graphs Ermelinda DeLaViña and Iride Gramajo Department of Computer and Mathematical Sciences University of Houston-Downtown Houston, Texas
More information