Complementary Acyclic Weak Domination Preserving Sets

Size: px
Start display at page:

Download "Complementary Acyclic Weak Domination Preserving Sets"

Transcription

1 International Journal of Research in Engineering and Science (IJRES) ISSN (Online): , ISSN (Print): ijresorg Volume 4 Issue 7 ǁ July 016 ǁ PP Complementary Acyclic Weak Domination Preserving Sets N Saradha a,vsaminathan b And K Angammal c A Assistant Professor, Department Of Mathematics, SCSVMV University, Enathur, Kanchipuram, Tamilnadu, India B Head & Coordinator, Ramanujan Research Center in Mathematics, Sarasathi Narayanan College, Madurai, Tamilnadu, India C Research Scholar, Department of Mathematics, SCSVMV University, Enathur, Kanchipuram, Tamilnadu, India Abstract: Let G = (V, E) be a simple graph A subset D of V(G) is called complementary acyclic eak domination preserving set of G (c-adp set of G) if < V D > is acyclic and ( D ) ( G) The minimum cardinality of a c-adp set in G is called the complementary acyclic eak domination preserving number of G and denoted by c-adpn(g) A c-adp set of G of cardinality c-adpn(g) is called a c-adpn-set of G In this paper, e introduce and discuss the concept of complementary acyclic eak domination preserving sets Keyords: Complementary acyclic eak domination preserving set,complementary acyclic eak domination preserving number I INTRODUCTION By a graph e mean, simple and undirected graph G(V, E) here V denotes its vertex set and E its edge set Degree of a vertex u is denoted by d(u) The maximum degree of a graph G is denoted by Δ(G) We denote a cycle on n vertices by C n, a path on n vertices by P n and a complete graph on n vertices by K n A graph G is connected if any to vertices of G are connected by a path A maximal connected sub graph of a graph G is called a component of G The number of components of G is denoted by ω(g) The complement G of G is the graph ith vertex set V in hich to vertices are adjacent if and only if they are not adjacent in G A graph G is said to be acyclic if it has no cycles A tree is a connected acyclic graph A bipartite graph is a graph hose vertex set can be partitioned into to disjoint non empty sets V 1 and V such that every edge has one end in V 1 and another end in V A complete bipartite graph is a bipartite graph here each vertex of V 1 is adjacent to every vertex in V The complete bipartite graph ith partitions of order V 1 = m and V = n, denoted by K m,n A star denoted by K 1,n-1 is a tree ith one root vertex and n-1 pendant vertices A bistar, denoted by D(r,s) is the graph obtained by joining the root vertices of the stars K 1,r and K 1,s A heel graph denoted by W n is a graph ith n vertices formed by joining a single vertex to all vertices of C n-1 A helm graph, denoted by H n is a graph obtained from the heel W n by attaching a pendant vertex to each vertex in the outer cycle of W n Corona of to graphs G 1 and G, denoted by G1 G is the graph obtained by taking one copy of G 1 and V(G 1 ) copies of G in hich i th vertex of G 1 is joined to every vertex in the i th copy of G If D is a subset of V, then D denoted the vertex induced sub graph of G induced by D The open neighborhood of a set D of vertices of graph G, denoted by N(D) is the set of all vertices adjacent to some vertex in D, and D D N is called the closed neighborhood of D, denoted by N[D] The diameter of a connected graph is the maximum distance beteen to vertices in G and is denoted by diam(g) A cut-vertex of a graph G is a vertex hose removal increases the number of components A vertex cut of a connected graph G is a set of vertices hose removal results in a disconnected graph The connectivity or vertex connectivity of a graph G, denoted by k(g) (here G is not complete) is the size of a smallest vertex cut A connected sub graph H of a connected graph G is called a H-cut if ω(g-h) For any real number denotes the largest integer less than or equal to x A subset D of V is called a dominating set of G if every vertex in V-D is adjacent to at least one vertex in D The domination number γ(g) of G is the minimum cardinality taken over all dominating set D in G A dominating set D of G is called a eak dominating set of G if for every v V D there exist a vertex u D such that uv V(G) and d( u) d( v) The minimum cardinality taken over all eak dominating sets is the eak domination number and is denoted by (G ) In this paper, e use this idea to develop the concept of complementary acyclic eak domination preserving number of a graph ijresorg 44 Page

2 Complementary Acyclic Weak Domination Preserving Sets N Saradha a,vsaminathan b Complementary Acyclic Weak Domination Preserving: Definition: 1 A subset D of G is called a complementary acyclic eak domination preserving set of G (c-adp set of G) if V D is acyclic and ( D ) ( G) The minimum cardinality of a c-adp set in G is called the complementary acyclic eak domination preserving number of G and is denoted by c-adpn(g) A c-adp set of G of cardinality c-adpn(g) is called a c-adpn- set of G Example: v {,v } is a complementary acyclic eak domination preserving set of G Remark: 3 Let G be a simple graph If c-adp set of G is independent, then (G) = 1 Remark: 4 Since V(G) is c-adp set, the existence of a c-adp sets is guaranteed in any graph Remark: 5 The c-adp set property is superhereditary, since any super set of a c-adp set is a c-adp set Hence a c-adp set is minimal if and only if it is 1-minimal c-adpn for standard graphs 1 c-adpn(k ) = n 1 c-adpn(k n ) = n, n 3 3 c-adpn(k 1,n ) = n 4 c-adpn(k m,n ) = max {m, n} 5 c-adpn(d m,n ) = m +n Theorem: 31 For any Path P n, n 3 II n c adpn( Pn ) if n 1(mod 3) 3 n 1if n 0 or (mod 3) 3 Theorem: 3 For any cycle C n, n 3 c adpn( C n n ) if n 1(mod 3) 3 n 1if n 0 or (mod 3) 3 Theorem: 33 For any heel W n, n 4 n c adpn( Wn ) if n is even n 1 if n is odd Fig 1 MAIN RESULT Observation 34 A c-adpn-set of a connected graph G need not induce a connected sub graph ijresorg 45 Page

3 Complementary Acyclic Weak Domination Preserving Sets N Saradha a,vsaminathan b Example: 35 v v 7 v 8 Fig 31 D = {v,,v 8 } is a c-adpn-set hich is disconnected Observation: 36 ( G) c adpn ( G) if and only if any c-adpn-set induces a complete subgraph Proof: By hypothesis c adpn ( G) ( G) Let D be a c-adpn-set of G c adpn ( G) D ( G) D ( Therefore D is a complete sub graph Conversely, let any c-adpn-set induces a complete sub graph Let D be a c-adpn-set of G D ( D ( G) That is c adpn ( G) ( G) Example: 37 v D={v,, } is a eak dominating set ( D ) 3 and also D is a c-adpn-set Remark: 38 If ( G) ( G), then dpn( G) ( G) But c-adpn(g) may be greater than (G ) Example: 39 D = {v,, }, ( G) ( G) and c-adpn(g) = 3 Fig 3 ijresorg 46 Page

4 Complementary Acyclic Weak Domination Preserving Sets N Saradha a,vsaminathan b v Fig 33 Definition: 310 A subset D of G is called a minimal c-adp set of G if D is a c-adp set of G and no subset of D is a c-adp set of G Theorem: 311 Let D be a c-adp set of G D is minimal if and only if for any u in D, either V (D {u}) contains a cycle or ( D { u} ) ( G) Proof: obvious Definition: 31 The maximum cardinality of a minimum c-adp set of G is called the upper c-adp number of G and is denoted by c-adpn(g) Remark: 313 There are graphs G ith c-adpn(g) < c-adpn(g) III FINE C-AWDP GRAPHS Definition: 41 A graph G is a fine c-adp graph if all minimal c-adp sets have the same cardinality Example: 4 (i) K n,n is a fine c-adp graph (ii) All cycles are fine c-adp graphs Theorem: 43 Let G 1 and G be graphs Suppose G 1 contains a cycle and G is acyclic and G ) ( ) Then have equal cardinality Proof: Suppose G 1 contains a cycle and G is acyclic and G ) ( ) 1 G ( 1 G G is a fine c-adp graph if and only if G is a fine c-adp graph and all minimal c-a sets of G 1 G1 G but it is not a dp set G1 G Any c-adp set of G 1 is a c-a ( 1 G set of Let D be a minimal c-adp set of G and D 1 be a minimal c-a set of G 1 Clearly, ( D ) ( G) ( G1 ) ( D1 ) Therefore D1 D is a minimal c-adp set of G1 G Let D D 1 D, here D 1 V ( G 1 ) and D V(G ) Since D is a c-a set of G1 G, D 1 is a c-a set of G 1 and D is a c-a set of G D) ( D D ) max{ ( D ), ( D } ( G G ) ( ) If D ) ( ) then ( G ( D1 ) ( G) ( G1 ) ( D1 ) ( D Therefore ( D1 ) ( D ) ( G) ( 1 D, a contradiction, since D 1 is a subset of V(G 1 ) Therefore ) Therefore D is a c-adp set of G and G is a fine c-adp graph if D 1 is c-a set of G 1 Since D is minimal, D 1 and D are also minimal Thus, and only if G is a fine c-adp graph and all minimal c-a set of G 1 have equal cardinality Similar argument can be given if G 1 contains a cycle and G is a cyclic 1 G IV CONCLUSION We found complementary acyclic eak domination preserving number for some standard graphs and general graphs REFERENCES [1] Frank Harary, Graph Theory, Narosa Publishing House, Reprint 1997 [] Gary Chartrand, Ping Zhang Chromatic Graph Theory CRC press, Taylor Dr Francis group A chapman and Hall book, 009 [3] Teresa WHaynes, Stephen THedetniemi, Peter JSlater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc,ne York,Basel,Hong Kong 1998 ijresorg 47 Page

5 Complementary Acyclic Weak Domination Preserving Sets N Saradha a,vsaminathan b [4] SM Hedetniemi, STHedetniemi, DF Rall, Acyclic Domination,Discrete Mathematics (000), [5] MPoopalaranjani, On some coloring and domination parameters in graphs, PhD Thesis, Bharathidasan University, India, 006 [6] MValliammal, SPSubbiah, VSaminathan, Complementary acyclic chromatic preserving sets in graphs, Vol3, 013, No8, ijresorg 48 Page

Triple Connected Domination Number of a Graph

Triple 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 information

International Journal of Mathematical Archive-7(9), 2016, Available online through ISSN

International Journal of Mathematical Archive-7(9), 2016, Available online through  ISSN International Journal of Mathematical Archive-7(9), 2016, 189-194 Available online through wwwijmainfo ISSN 2229 5046 TRIPLE CONNECTED COMPLEMENTARY ACYCLIC DOMINATION OF A GRAPH N SARADHA* 1, V SWAMINATHAN

More information

Strong Triple Connected Domination Number of a Graph

Strong 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 information

Triple Connected Complementary Tree Domination Number Of A Graph V. Murugan et al.,

Triple 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 information

Bounds for Support Equitable Domination Number

Bounds for Support Equitable Domination Number e-issn 2455 1392 Volume 2 Issue 6, June 2016 pp. 11 15 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Bounds for Support Equitable Domination Number R.Guruviswanathan 1, Dr. V.Swaminathan

More information

Degree Equitable Domination Number and Independent Domination Number of a Graph

Degree 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 information

Global Triple Connected Domination Number of A Graph

Global 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

THE 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, 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 information

Chromatic Transversal Domatic Number of Graphs

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 information

Efficient Triple Connected Domination Number of a Graph

Efficient 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 information

Eccentric domination in splitting graph of some graphs

Eccentric 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 information

On Independent Equitable Cototal Dominating set of graph

On 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 information

Domination Number of Jump Graph

Domination 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 information

PAijpam.eu TOTAL CO-INDEPENDENT DOMINATION OF JUMP GRAPH

PAijpam.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 information

Triple Domination Number and it s Chromatic Number of Graphs

Triple Domination Number and it s Chromatic Number of Graphs Triple Domination Number and it s Chromatic Number of Graphs A.Nellai Murugan 1 Assoc. Prof. of Mathematics, V.O.Chidambaram, College, Thoothukudi-628 008, Tamilnadu, India anellai.vocc@gmail.com G.Victor

More information

GEODETIC DOMINATION IN GRAPHS

GEODETIC 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 information

A note on isolate domination

A 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 information

K 4 C 5. Figure 4.5: Some well known family of graphs

K 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 information

(1,2) - Domination in Line Graphs of C n, P n and K 1,n

(1,2) - Domination in Line Graphs of C n, P n and K 1,n American Journal of Computational and Applied Mathematics 03, 3(3): 6-67 DOI: 0.593/j.ajcam.030303.0 (,) - Domination in Line Graphs of C n, P n and K,n N. Murugesan, Deepa. S. Nair * Post Graduate and

More information

Former Bulletin of Society of Mathematicians Banja Luka ISSN (p), ISSN X (o)

Former Bulletin of Society of Mathematicians Banja Luka ISSN (p), ISSN X (o) Bulletin of International Mathematical Virtual Institute ISSN 1840-4359 Vol. 1(2011), 39-43 Former Bulletin of Society of Mathematicians Banja Luka ISSN 0354-5792 (p), ISSN 1986-521X (o) COMPLEMENT FREE

More information

Rainbow game domination subdivision number of a graph

Rainbow 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 information

The Restrained Edge Geodetic Number of a Graph

The 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 information

FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH

FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH International Journal of Information Technology and Knowledge Management July-December 2011 Volume 4 No 2 pp 495-499 FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH G MAHADEVAN 1 V

More information

(1, 2) -Vertex Domination in Fuzzy Graphs

(1, 2) -Vertex Domination in Fuzzy Graphs (1, 2) -Vertex Domination in Fuzzy Graphs N.Sarala 1, T.Kavitha 2 Associate Professor, Department of Mathematics, ADM College, Nagapattinam, Tamilnadu, India 1 Assistant Professor, Department of Mathematics,

More information

Eccentric Coloring of a Graph

Eccentric 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 information

Characterisation of Restrained Domination Number and Chromatic Number of a Fuzzy Graph

Characterisation of Restrained Domination Number and Chromatic Number of a Fuzzy Graph Characterisation of Restrained Domination Number and Chromatic Number of a Fuzzy Graph 1 J.S.Sathya, 2 S.Vimala 1 Research Scholar, 2 Assistant Professor, Department of Mathematics, Mother Teresa Women

More information

Vertex Minimal and Common Minimal Equitable Dominating Graphs

Vertex Minimal and Common Minimal Equitable Dominating Graphs Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 10, 499-505 Vertex Minimal and Common Minimal Equitable Dominating Graphs G. Deepak a, N. D. Soner b and Anwar Alwardi b a Department of Mathematics The

More information

THE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH

THE 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 information

Double Domination Edge Critical Graphs.

Double 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 information

CLASSES OF VERY STRONGLY PERFECT GRAPHS. Ganesh R. Gandal 1, R. Mary Jeya Jothi 2. 1 Department of Mathematics. Sathyabama University Chennai, INDIA

CLASSES 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 information

Global Alliance Partition in Trees

Global 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 information

Roman Domination in Complementary Prism Graphs

Roman 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 information

Average D-distance Between Edges of a Graph

Average 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 information

Total Dominator Colorings in Graphs

Total Dominator Colorings in Graphs International Journal of Advancements in Research & Technology, Volume 1, Issue 4, September-2012 1 Paper ID-AJO11533,Volume1,issue4,September 2012 Total Dominator Colorings in Graphs Dr.A.Vijayaleshmi

More information

Monophonic Chromatic Parameter in a Connected Graph

Monophonic 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 information

Domination, 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 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 information

BLAST DOMINATION NUMBER OF A GRAPH FURTHER RESULTS. Gandhigram Rural Institute - Deemed University, Gandhigram, Dindigul

BLAST DOMINATION NUMBER OF A GRAPH FURTHER RESULTS. Gandhigram Rural Institute - Deemed University, Gandhigram, Dindigul BLAST DOMINATION NUMBER OF A GRAPH FURTHER RESULTS G.Mahadevan 1, A.Ahila 2*, Selvam Avadayappan 3 1 Department of Mathematics, Gandhigram Rural Institute - Deemed University, Gandhigram, Dindigul E-Mail:drgmaha2014@gmail.com

More information

Complementary nil vertex edge dominating sets

Complementary 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

[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor

[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 information

SIGN DOMINATING SWITCHED INVARIANTS OF A GRAPH

SIGN DOMINATING SWITCHED INVARIANTS OF A GRAPH BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-87, ISSN (o) 0-955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 5-6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA LUKA

More information

Neighborhood Triple Connected Domination Number of a Graph

Neighborhood Triple Connected Domination Number of a Graph International Journal of Computational Engineering Research Vol, 04 Issue, 3 Neighborhood Triple Connected Domination Number of a Graph G. Mahadevan 1 N. Ramesh 2 C. Sivagnanam 3 Selvam Avadayappan 4 A.

More information

Planar Graph Characterization - Using γ - Stable Graphs

Planar Graph Characterization - Using γ - Stable Graphs Planar Graph Characterization - Using γ - Stable Graphs M. YAMUNA VIT University Vellore, Tamilnadu INDIA myamuna@vit.ac.in K. KARTHIKA VIT University Vellore, Tamilnadu INDIA karthika.k@vit.ac.in Abstract:

More information

S. K. Vaidya and Rakhimol V. Isaac

S. 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 information

Number Theory and Graph Theory

Number 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 information

38. Triple Connected Domination Number of a Graph

38. Triple Connected Domination Number of a Graph 38. Triple Connected Domination Number of a Graph Ms.N.Rajakumari *& V.Murugan** *Assistant Professor, Department of Mathematics, PRIST University, Thanjavur, Tamil Nadu. **Research Scholar, Department

More information

Discrete Mathematics. Elixir Dis. Math. 92 (2016)

Discrete Mathematics. Elixir Dis. Math. 92 (2016) 38758 Available online at www.elixirpublishers.com (Elixir International Journal) Discrete Mathematics Elixir Dis. Math. 92 (2016) 38758-38763 Complement of the Boolean Function Graph B(K p, INC, K q )

More information

Total Domination on Generalized Petersen Graphs

Total Domination on Generalized Petersen Graphs International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 2, February 2014, PP 149-155 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Total

More information

THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction

THE 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 information

DOUBLE DOMINATION CRITICAL AND STABLE GRAPHS UPON VERTEX REMOVAL 1

DOUBLE 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 information

We need the following Theorems for our further results: MAIN RESULTS

We 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 information

Bipartite Roots of Graphs

Bipartite 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 information

The Edge Fixing Edge-To-Vertex Monophonic Number Of A Graph

The 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 information

The Dual Neighborhood Number of a Graph

The 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 information

Graphs with Two Disjoint Total Dominating Sets

Graphs with Two Disjoint Total Dominating Sets Graphs with Two Disjoint Total Dominating Sets Izak Broere, Rand Afrikaans University Michael Dorfling, Rand Afrikaans University Wayne Goddard, University of Natal Johannes H. Hattingh, Georgia State

More information

Open Neighborhood Chromatic Number Of An Antiprism Graph

Open Neighborhood Chromatic Number Of An Antiprism Graph Applied Mathematics E-Notes, 15(2015), 54-62 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Open Neighborhood Chromatic Number Of An Antiprism Graph Narahari Narasimha

More information

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE

More information

Efficient Domination number and Chromatic number of a Fuzzy Graph

Efficient Domination number and Chromatic number of a Fuzzy Graph Efficient Domination number and Chromatic number of a Fuzzy Graph Dr.S.Vimala 1 J.S.Sathya 2 Assistant Professor,Department of Mathematics,Mother Teresa Women s University, Kodaikanal, India Research Scholar,

More information

Sunoj B S *, Mathew Varkey T K Department of Mathematics, Government Polytechnic College, Attingal, Kerala, India

Sunoj B S *, Mathew Varkey T K Department of Mathematics, Government Polytechnic College, Attingal, Kerala, India International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 1 ISSN : 256-3307 Mean Sum Square Prime Labeling of Some Snake Graphs

More information

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

DO 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 information

THE SEMIENTIRE DOMINATING GRAPH

THE 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 information

{ 1} Definitions. 10. Extremal graph theory. Problem definition Paths and cycles Complete subgraphs

{ 1} Definitions. 10. Extremal graph theory. Problem definition Paths and cycles Complete subgraphs Problem definition Paths and cycles Complete subgraphs 10. Extremal graph theory 10.1. Definitions Let us examine the following forbidden subgraph problems: At most how many edges are in a graph of order

More information

NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS

NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS A. Muthaiyan # and G. Bhuvaneswari * Department of Mathematics, Government Arts and Science College, Veppanthattai, Perambalur - 66, Tamil Nadu, India. P.G.

More information

Independent Domination Number and Chromatic Number of a Fuzzy Graph

Independent Domination Number and Chromatic Number of a Fuzzy Graph International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 6, June 2014, PP 572-578 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Independent

More information

(1, 2) -Vertex Domination in Fuzzy Line Graphs

(1, 2) -Vertex Domination in Fuzzy Line Graphs International Journal of Engineering, Science and Mathematics Vol. 5 Issue 4, December 2016, ISSN: 2320-0294 Impact Factor: 6.765 Journal Homepage: Double-Blind Peer Reviewed Refereed Open Access International

More information

Chapter-0: Introduction. Chapter 0 INTRODUCTION

Chapter-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 information

Square Difference Prime Labeling for Some Snake Graphs

Square Difference Prime Labeling for Some Snake Graphs Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (017), pp. 1083-1089 Research India Publications http://www.ripublication.com Square Difference Prime Labeling for Some

More information

CMSC Honors Discrete Mathematics

CMSC Honors Discrete Mathematics CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical

More information

International Journal of Mathematical Archive-6(10), 2015, Available online through ISSN

International 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 information

Bounds for the m-eternal Domination Number of a Graph

Bounds for the m-eternal Domination Number of a Graph Bounds for the m-eternal Domination Number of a Graph Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg South Africa mahenning@uj.ac.za Gary MacGillivray Department

More information

ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT

ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT A graph G is self complementary if it is isomorphic to its complement G.

More information

Perfect Dominating Sets in Fuzzy Graphs

Perfect Dominating Sets in Fuzzy Graphs IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, Volume 8, Issue 3 (Sep. - Oct. 2013), PP 43-47 Perfect Dominating Sets in Fuzzy Graphs S. Revathi, P.J.Jayalakshmi, C.V.R.Harinarayanan

More information

On Sequential Topogenic Graphs

On 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 information

On t-restricted Optimal Rubbling of Graphs

On 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 information

Some 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. 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 information

CHAPTER 5. b-colouring of Line Graph and Line Graph of Central Graph

CHAPTER 5. b-colouring of Line Graph and Line Graph of Central Graph CHAPTER 5 b-colouring of Line Graph and Line Graph of Central Graph In this Chapter, the b-chromatic number of L(K 1,n ), L(C n ), L(P n ), L(K m,n ), L(K 1,n,n ), L(F 2,k ), L(B n,n ), L(P m ӨS n ), L[C(K

More information

LOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF PATHS AND CYCLES

LOCAL 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 information

Super vertex Gracefulness of Some Special Graphs

Super vertex Gracefulness of Some Special Graphs IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 07-15 www.iosrjournals.org Super vertex Gracefulness of Some Special Graphs N.Murugesan

More information

Planar graphs. Chapter 8

Planar graphs. Chapter 8 Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations

More information

AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH

AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.

More information

Graph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow

Graph 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 information

Some bounds on chromatic number of NI graphs

Some 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 information

Complete Cototal Domination

Complete Cototal Domination Chapter 5 Complete Cototal Domination Number of a Graph Published in Journal of Scientific Research Vol. () (2011), 547-555 (Bangladesh). 64 ABSTRACT Let G = (V,E) be a graph. A dominating set D V is said

More information

On graphs with disjoint dominating and 2-dominating sets

On graphs with disjoint dominating and 2-dominating sets On graphs with disjoint dominating and 2-dominating sets 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Mathematics University of Johannesburg Auckland Park, 2006 South Africa Email: mahenning@uj.ac.za

More information

To Find Strong Dominating Set and Split Strong Dominating Set of an Interval Graph Using an Algorithm

To Find Strong Dominating Set and Split Strong Dominating Set of an Interval Graph Using an Algorithm Dr A Sudhakaraiah, V Rama Latha, E Gnana Deepika, TVenkateswarulu/International Journal Of To Find Strong Dominating Set and Split Strong Dominating Set of an Interval Graph Using an Algorithm Dr A Sudhakaraiah

More information

On the packing numbers in graphs arxiv: v1 [math.co] 26 Jul 2017

On 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 information

Domination and Irredundant Number of 4-Regular Graph

Domination and Irredundant Number of 4-Regular Graph Domination and Irredundant Number of 4-Regular Graph S. Delbin Prema #1 and C. Jayasekaran *2 # Department of Mathematics, RVS Technical Campus-Coimbatore, Coimbatore - 641402, Tamil Nadu, India * Department

More information

DOMINATION PARAMETERS OF A GRAPH AND ITS COMPLEMENT

DOMINATION 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 information

Chapter 5. Fibonacci Graceful Labeling of Some Graphs

Chapter 5. Fibonacci Graceful Labeling of Some Graphs Chapter 5 ibonacci Graceful Labeling of Some Graphs 12 Chapter 5. ibonacci and Super ibonacci Graceful Labeling of Some Graphs 13 5.1 Introduction The brief account of graceful labeling is given in chapter

More information

Inverse Accurate Independent Domination In Fuzzy Graphs

Inverse 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 information

Graceful Labeling for Cycle of Graphs

Graceful Labeling for Cycle of Graphs International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs

More information

On Balance Index Set of Double graphs and Derived graphs

On Balance Index Set of Double graphs and Derived graphs International Journal of Mathematics and Soft Computing Vol.4, No. (014), 81-93. ISSN Print : 49-338 ISSN Online: 319-515 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas

More information

Eternal Domination: Criticality and Reachability

Eternal Domination: Criticality and Reachability Eternal Domination: Criticality and Reachability William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224-2669 wkloster@unf.edu Gary MacGillivray Department of Mathematics

More information

TREES WITH UNIQUE MINIMUM DOMINATING SETS

TREES 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 information

Binding Number of Some Special Classes of Trees

Binding 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 information

Root Cube Mean Labeling of Graphs

Root Cube Mean Labeling of Graphs International Journal of Engineering Science, Advanced Computing and Bio-Technology Vol 8, No 4, October December 07, pp 48-55 Root Cube Mean Labeling of Graphs R Gowri and *G Vembarasi Department of mathematics

More information

Introduction to Graph Theory

Introduction 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 information

Hypo-k-Totally Magic Cordial Labeling of Graphs

Hypo-k-Totally Magic Cordial Labeling of Graphs Proyecciones Journal of Mathematics Vol. 34, N o 4, pp. 351-359, December 015. Universidad Católica del Norte Antofagasta - Chile Hypo-k-Totally Magic Cordial Labeling of Graphs P. Jeyanthi Govindammal

More information

Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs

Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs ISSN 0975-3303 Mapana J Sci, 11, 4(2012), 121-131 https://doi.org/10.12725/mjs.23.10 Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs R Mary Jeya Jothi * and A Amutha

More information

Domination in Jahangir Graph J 2,m

Domination 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 information

Chapter 2 Graphs. 2.1 Definition of Graphs

Chapter 2 Graphs. 2.1 Definition of Graphs Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,

More information