DOMINATION IN DEGREE SPLITTING GRAPHS S , S t. is a set of vertices having at least two vertices and having the same degree and T = V S i
|
|
- Byron Jennings
- 6 years ago
- Views:
Transcription
1 Journal of Analysis and Comutation, Vol 8, No 1, (January-June 2012) : 1-8 ISSN : J A C Serials Publications DOMINATION IN DEGREE SPLITTING GRAPHS B BASAVANAGOUD 1*, PRASHANT V PATIL 2 AND SUNILKUMAR M HOSAMANI 3 Abstract Let G = (V, E) be a grah with V = S 1 S 2, S t T where each S i is a set of vertices having at least two vertices and having the same degree and T = V S i The degree slitting grah of G is denoted by DS(G) is obtained from G by adding vertices w 1, w 2,, w t and joining w i to each vertex of S i (1 i t) Let the vertices and the edges of a grah G are called the elements of G In this aer, we study the variation in domination from the grah G to the degree slitting grah DS(G) Also we establish many bounds on (DS(G)) in terms of elements of G but not in terms of elements of DS(G) 2000 Mathematics Subject Classification: 05C69 Keywords: Degree slitting grah, domination number, domatic number 1 INTRODUCTION The grahs considered here are finite, undirected without loos or multile edges Let G = ( V, E) be a grah and the vertices and edges be called the elements of G Any undefined term in this aer may be found in Harary [2] Let G = ( V, E) be a grah A set D V is a dominating set of G if every vertex in V D is adjacent to some vertex in D The domination number (G) of G is the minimum cardinality of a minimal dominating set of G For an early survey on domination refer [1] In [4], R Ponaraj and S Somasundaram have initiated a study of degree slitting grah DS(G) of a (, q) grah which is stated as follows Let G = (V, E) be a grah with V = S 1 S 2, S t T where each S i is a set of vertices having at least two vertices and having the same degree and T = V S i The degree slitting grah of G is denoted by DS(G) is obtained from G by adding vertices w 1, w 2,, w t and joining w i to each vertex of S i (1 i t) 1,2,3 Deartment of Mathematics, Karnatak University, Dharwad * Corresonding Author bbasavanagoud@gmailcom
2 2 B BASAVANAGOUD, PRASHANT V PATIL AND SUNILKUMAR M HOSAMANI In this aer, we study the variation in domination from the grah G to the degree slitting grah DS(G) Also we establish, many bounds on γ(ds(g)) in terms of elements of G but not in terms of elements of DS(G) In Figure 1, a grah G and its degree slitting grah DS(G) are shown Figure 1: Here S 1 = {1, 7}, S 2 = {3, 4}, S 3 = {2, 5, 6} and T = φ 2 RESULTS First we calculate the domination number of DS(G) for some standard class of grahs Proosition 1: For any ath G = P, 3 then γ(ds(g)) = 2 Proosition 2: For any wheel G = W, 5 then γ(ds(g)) = 2 Proosition 3: If G is a regular grah, then γ(ds(g)) = 1
3 DOMINATION IN DEGREE SPLITTING GRAPHS 3 Proof: Let G be any regular grah Then DS(G) = G + K 1 and (DS(G)) = 1 Hence γ(ds(g)) = 1 The next result gives the uer bound for γ(ds(g)) Theorem 21: For any grah G, γ(ds(g)) w i T, where w i ; 1 i t and T are as defined in the definition of DS(G) Proof: Let G be any grah By the definition of DS(G), we have V(DS(G)) = S 1 S 2, S t T and w i be the set of vertices of all the corresonding sets of S i ; 1 i t in DS(G) To rove the above in equality we consider the following cases Case 1: Let T = φ Since each w i ; 1 i t is indeendent in DS(G) If T = φ then clearly w i will be a maximal indeendent set in DS(G) Since every maximal indeendent set is a minimal dominating set Therefore, γ(ds(g)) = w i Case 2: Let T φ Then there exist at least one vertex in G which is not resent in S i ; 1 i t Since G is an induced subgrah of DS(G), to dominate all the vertices of DS(G) we need at lest D w i T vertices Hence γ(ds(g)) D w i T Theorem 22: For any grah G, γ(ds(g)) 2 Proof: Let G be any grah of order To rove the result we consider the following cases Case 1: If T = φ, G has atmost S i 2 Hence wi 2 Therefore by Theorem 21, we get γ(ds(g)) w i 2 2 Case 2: If T = φ Then G has atmost S i 2 T Hence wi 2 T Therefore by Theorem 21, we have γ(ds(g)) w i + T T + T 2 = 2 2
4 4 B BASAVANAGOUD, PRASHANT V PATIL AND SUNILKUMAR M HOSAMANI In the next theorem, we characterize the grahs whose degree slitting grah have domination number equal to the half of the order of G Theorem 23: Let G be any nontrivial connected grah G of even order Then γ(ds(g)) = 2 if and only if T = φ and cardinality of each Si ; 1 i t is even Proof: Let G be any nontrivial connected grah G of even order with T = φ and each S i ; 1 i t is even Then by using Theorem 21 and Theorem 22, we get γ(ds(g)) = w i = 2 = ( is even) 2 Conversely, let G be any nontrivial connected grah with γ(ds(g)) = 2 and T φ Then by Theorem 21, γ(ds(g)) w i T and by Theorem 22, we get γ(ds(g)) 2 This imlies that V(G) is odd and a contradiction to our assumtion Hence G must be a grah of even order with T = φ and S i is even Theorem 24: Let G be any nontrivial tree T Then γ(t) γ(ds(t)) Proof: Let G be any nontrivial tree T Let D = {v 1, v 2,, v i }; 1 i be the minimum dominating set of T Then γ(t) = D Let S i be the set of all equal degree vertices in a tree T and H = V S i Therefore D = w i (H D) is a dominating set of DS(G) Hence (DS(T)) D = w i (H D) D = γ(t) Next theorem gives the relation between indeendence number of G and the domination number of DS(G) Theorem 25: For any grah G, γ(ds(g)) β 0 (G) Further equality holds for G = K
5 DOMINATION IN DEGREE SPLITTING GRAPHS 5 Proof: For any grah G, we have β 0 (G) Also by Theorem 22, γ(ds(g)) 2 Therefore γ(ds(g)) β (G) 0 Theorem A [3] For any grah G, q γ(g) Furthermore, γ(g) = q if and only if each comonent of G is a star Theorem 26: Let G = (, q) be any nontrivial connected grah with maximum degree, then q + 1 γ(ds(g)) (G) + w i Further, the lower bound is attained if and only if each comonent of G is a star and the uer bound is attained for G = K Proof: First consider the lower bound Let q = 1, then G is a tree Therefore the lower bound follows from the fact that for any nontrivial tree γ(ds(g)) 2 For equality, suose each comonent of a grah G is a star then the result can be easily verified Conversely, let q + 1 = γ(ds(g)) Then G has exactly q comonents with domination number equal to one Thus G is a forest Since q + 1 = γ(ds(g)), therefore by Theorem A, each comonent of a grah G is a star Now consider the uer bound Let v be a maximum degree vertex in G Then v = (G) Since G is a subgrah of DS(G) and each w i is indeendent in DS(G) Therefore γ(ds(g)) w i {v} (G) + w i Suose G = K, then the equality can be easily verified Proosition 4: Let G be any (, q) grah having a vertex of (G) = 1 Then G = H + K 1 and DS(G) has the following roerties (i) If H is a comlete grah, then γ(ds(g))sets are recisely {w 1 }, {v 1 }, {v 2 },, {v } (ii) If H is a block (which is not comlete) then there exist an unique γ(ds(g)) set {v x, w i }; 1 i t in DS(G) By observing all these results we raise one oen roblem which is stated as follows Oen Problem: Characterize the grahs for which γ(g) = γ(ds(g)) A artial solution to the above roblem is as follows Theorem 27: For any grah G, γ(g) = γ(ds(g)) if G is one of the following grahs (i) G = K (ii) G = K m,n (iii) bistar or tristar Proof: If G is any one of the grah mentioned in the statement of the theorem, then one can easily verify the result
6 6 B BASAVANAGOUD, PRASHANT V PATIL AND SUNILKUMAR M HOSAMANI 3 DOMATIC NUMBER OF DS(G) Let G be a grah A artition of its vertex set V(G) is called a domatic artition of G if each class of is a dominating set in G The maximum number of classes of a domatic artition of G is called the domatic number of G and it is denoted by d(g) The domatic number was introduced by Cockayne and Hedetniemi [1] Theorem 31: For any grah G, d(ds(g)) δ(g) + 2 Proof: For any grah G, d(g) δ(g) + 1, equality holds if and only if G = K If G = K then DS(G) = K + 1 Hence the theorem Theorem 32: For any grah G having vertices, d(ds(g)) + d(()) DS G + 3 Proof: Let G be any grah having vertices Then by Theorem 31, d(ds(g)) δ(g) + 2 and d(ds ()G ) δ ()G + 2 ()G + 2 Therefore, d(ds(g)) + d(ds ()G ) δ(g) + ()G ) = + 3 Theorem 33: Let G be any grah having vertices Then d(ds(g)) + d(ds ()G ) = + 3 if and only if G = K or K Proof: Let d(ds(g)) + d(ds ()G ) = + 3 We roceed by induction on Suose, contrary to the assertion that G K or following cases K has vertices and d(ds(g)) + d(ds ()G ) = + 3 We consider the Case 1: In G if has an unique vertex of δ(g) = 0 then δ(g) = δ(ds(g)) and d(ds(g)) = 1, and ()G has a vertex of degree 1, which is unique, then ()G = 1 Therefore, d(ds(g)) + d(ds ()G ) = δ(g) δ ()G + 2 = 2 + ( 2) < + 3
7 DOMINATION IN DEGREE SPLITTING GRAPHS 7 Case 2: 0 < δ(g) < + 1 (31) 2 By assumtion, d(ds(g)) + d(ds ()G ) = + 3 Therefore, d(ds( ()G ) = + 3 d(ds(g)) = + 3 (δ(g) + 2) (By Theorem 31) = δ(g) + 1 (32) If all dominating sets in a maximum D artition of DS ()G have at least two vertices Then 2d(DS ()G ) 2( δ(g) + 1) (using 32) = + 3, a contradiction Hence some vertex v dominates G and {v w i } dominates DS ()G, Therefore deg (v) = w DS () G i, deg () v = 1 and deg G (v) = 0 Hence δ(g) = 0 = δ(ds(g)), contradiction to (31) If δ(ds(g)) = δ(g) = 0, aly Case 1, to DS(G) otherwise aly Case 2, to DS(G) Theorem 34: For any grah G with vertices, d(ds(g)) + γ(ds(g)) + 2, equality holds if and only if G = K Proof: If G = K, trivially d(ds(g)) + γ(ds(g)) + 2 Therefore, let G have vertices and G K From Theorem 26, we have γ(d S (G)) (G) + w i, hence γ(ds(g)) δ(g) + w i We claim that this inequality, d(ds(g)) δ(g) + 2, is strict Suose not then, γ(ds(g)) = δ(g) G = δ(ds(g)) + 2 Using the fact that d(ds(g)) + 1 γ (()) DS G, d(ds(g)) + 1 d (()) DS G2 + ie, d(ds(g)) ( d(ds(g)) + 2) + 1 from which on solving this equation we get, d(ds(g)) = + 1 and d(ds(g)) = 1
8 8 B BASAVANAGOUD, PRASHANT V PATIL AND SUNILKUMAR M HOSAMANI In the revious case G = K while d(g) = 1 imlies G has an isolated vertex v Since G v K 1, γ(ds(g)) > 1 In this case (G) = 0, w i = 1 and T = {v} Hence the inequality, γ(ds(g)) δ(g) + w i is strict Thus one of the inequalities γ(ds(g)) δ(g) + w i or d(ds(g)) d(g) + 2 is strict Hence d(ds(g)) + γ(ds(g)) < + 2 as asserted Nordhaus-Gaddum tye results for DS(G) Theorem 35: Let G be any grah having vertices, then (i) γ(ds(g)) + γ(ds ()G ) (ii) γ(ds(g)) γ(ds ()G ) ACKNOWLEDGEMENT This research was suorted by UGC-SAP DRS-II New Delhi, India: for REFERENCES [1] E J Cockayne and S T Hedetniemi, Towards a Theory of Domination in Grahs, Networks, 7(1977), [2] F Harary, Grah Theory, Addison-Wesley, Reading, Mass, (1969) [3] TW Haynes, ST Hedetniemi and PJ Slater, Fundamentals of Domination in Grahs, Marcel Dekker, Inc, New York (1998) [4] P Ponaraj and S Somasundaram, On the Degree Slitting Grah of a Grah, Nat Acad Sci Letters, 27 No 7 and 8 (2004), [5] B Zelinka, Domatic Numbers and Degrees of Vertices of a Grah, Math Slovaca, 33(1983),
Matching Transversal Edge Domination in Graphs
Available at htt://vamuedu/aam Al Al Math ISSN: 19-9466 Vol 11, Issue (December 016), 919-99 Alications and Alied Mathematics: An International Journal (AAM) Matching Transversal Edge Domination in Grahs
More informationThe Dominating Graph DG bcd (G) of a Graph G
The Dominating Grah (G) of a Grah G M. Bhanumathi 1, J. John Flavia 2 1 Associate Professor, Government Arts College for Women, Pudukkottai, TN, India 2 Research Scholar, Government Arts College for Women,
More informationON THE INJECTIVE DOMINATION OF GRAPHS
Palestine Journal of Mathematics Vol. 7(1)(018), 0 10 Palestine Polytechnic Uniersity-PPU 018 ON THE INJECTIVE DOMINATION OF GRAPHS Anwar Alwardi, R. Rangarajan and Akram Alqesmah Communicated by Ayman
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationNORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH
Discussiones Mathematicae Graph Theory 30 (2010 ) 257 263 NORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH Magdalena Lemańska Department of Applied Physics and Mathematics Gdańsk
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of
More informationA Note on Disjoint Dominating Sets in Graphs
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 43, 2099-2110 A Note on Disjoint Dominating Sets in Graphs V. Anusuya Department of Mathematics S.T. Hindu College Nagercoil 629 002 Tamil Nadu, India
More informationA note on the total domination number of a tree
A note on the total domination number of a tree 1 Mustapha Chellali and 2 Teresa W. Haynes 1 Department of Mathematics, University of Blida. B.P. 270, Blida, Algeria. E-mail: m_chellali@yahoo.com 2 Department
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationInverse Closed Domination in Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 2 (2016), pp. 1845-1851 Research India Publications http://www.ripublication.com/gjpam.htm Inverse Closed Domination in
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationClassification of rings with unit graphs having domination number less than four
REND. SEM. MAT. UNIV. PADOVA, Vol. 133 (2015) DOI 10.4171/RSMUP/133-9 Classification of rings with unit grahs having domination number less than four S. KIANI (*) - H. R. MAIMANI (**) - M. R. POURNAKI
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
More informationNordhaus Gaddum Bounds for Independent Domination
Nordhaus Gaddum Bounds for Independent Domination Wayne Goddard 1 Department of Computer Science, University of Natal, Durban 4041, South Africa Michael A. Henning School of Mathematics, Statistics and
More informationStrong Matching of Points with Geometric Shapes
Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationLilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3
Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationARTICLE IN PRESS Discrete Mathematics ( )
Discrete Mathematics Contents lists available at ScienceDirect Discrete Mathematics journal homeage: wwwelseviercom/locate/disc Maximizing the number of sanning trees in K n -comlements of asteroidal grahs
More informationCorrelation of domination parameters with physicochemical properties of octane isomers
Correlation of domination parameters with physicochemical properties of octane isomers Sunilkumar M. Hosamani Department of mathematics, Rani Channamma University, Belgaum, India e-mail: sunilkumar.rcu@gmail.com
More informationOn Degree Sum Energy of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 9, No. 3, 2016, 30-35 ISSN 1307-553 www.ejpam.com On Degree Sum Energy of a Graph Sunilkumar M. Hosamani 1,, Harishchandra S. Ramane 2 1 Department
More informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 09/25 Partitioning a graph into a dominating set, a total dominating set, and something else Henning, Michael A.; Löwenstein, Christian;
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationGeneralized connected domination in graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8, 006, 57 64 Generalized connected domination in graphs Mekkia Kouider 1 and Preben Dahl Vestergaard 1 Laboratoire de Recherche en Informatique,
More informationCO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS. S.Padmashini 1 and K.Nagarajan 2. Sri S.R.N.M.College,
International Journal of Science, Engineering and Technology Research (IJSETR), Volume 5, Issue 3, March 016 CO TOTAL DOMINATION ON STRONG LINE CORPORATE GRAPHS S.Padmashini 1 and K.Nagarajan 1 M.Phil
More informationGENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES
GENERALIZED INDEPENDENCE IN GRAPHS HAVING CUT-VERTICES Vladimir D. Samodivkin 7th January 2008 (Dedicated to Mihail Konstantinov on his 60th birthday) Abstract For a graphical property P and a graph G,
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationThe domination game played on unions of graphs
The domination game played on unions of graphs Paul Dorbec 1,2 Gašper Košmrlj 3 Gabriel Renault 1,2 1 Univ. Bordeaux, LaBRI, UMR5800, F-33405 Talence 2 CNRS, LaBRI, UMR5800, F-33405 Talence Email: dorbec@labri.fr,
More informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More information3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three
Vol.3, Issue.1, Jan-Feb. 2013 pp-231-239 ISSN: 2249-6645 3-Chromatic Cubic Graphs with Complementary Connected Domination Number Three Selvam Avadayappan, 1 S. Kalaimathy, 2 G. Mahadevan 3 1, 2 Department
More informationRestrained Independent 2-Domination in the Join and Corona of Graphs
Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3171-3176 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.711343 Restrained Independent 2-Domination in the Join and Corona of Graphs
More informationDOMINATION INTEGRITY OF TOTAL GRAPHS
TWMS J. App. Eng. Math. V.4, N.1, 2014, pp. 117-126. DOMINATION INTEGRITY OF TOTAL GRAPHS S. K. VAIDYA 1, N. H. SHAH 2 Abstract. The domination integrity of a simple connected graph G is a measure of vulnerability
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationOn the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z = 1
International J.Math. Combin. Vol.(018), 44-66 On the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z 1 B. Basavanagoud and Chitra E. (Department of Mathematics,
More informationTHE SET CHROMATIC NUMBER OF RANDOM GRAPHS
THE SET CHROMATIC NUMBER OF RANDOM GRAPHS ANDRZEJ DUDEK, DIETER MITSCHE, AND PAWE L PRA LAT Abstract. In this aer we study the set chromatic number of a random grah G(n, ) for a wide range of = (n). We
More information#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS
#A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
More information#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.
#A6 INTEGERS 15A (015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I Katalin Gyarmati 1 Deartment of Algebra and Number Theory, Eötvös Loránd University and MTA-ELTE Geometric and Algebraic Combinatorics
More informationA BOUND FOR THE COPS AND ROBBERS PROBLEM *
SIAM J. DISCRETE MATH. Vol. 25, No. 3,. 1438 1442 2011 Society for Industrial and Alied Mathematics A BOUND FOR THE COPS AND ROBBERS PROBLEM * ALEX SCOTT AND BENNY SUDAKOV Abstract. In this short aer we
More informationTHE RAINBOW DOMINATION NUMBER OF A DIGRAPH
Kragujevac Journal of Mathematics Volume 37() (013), Pages 57 68. THE RAINBOW DOMINATION NUMBER OF A DIGRAPH J. AMJADI 1, A. BAHREMANDPOUR 1, S. M. SHEIKHOLESLAMI 1, AND L. VOLKMANN Abstract. Let D = (V,
More informationACYCLIC WEAK CONVEX DOMINATION IN GRAPHS
International Journal of Mathematics & Engineering with Computers Vol 2, No -2, pp 65-72, January-December 20 ACYCLIC WEAK CONVEX DOMINATION IN GRAPHS TN Janakiraman, and PJA Alphonse ABSTRACT: In a graph
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
More informationA note on obtaining k dominating sets from a k-dominating function on a tree
A note on obtaining k dominating sets from a k-dominating function on a tree Robert R. Rubalcaba a,, Peter J. Slater a,b a Department of Mathematical Sciences, University of Alabama in Huntsville, AL 35899,
More informationA Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs
ISSN 974-9373 Vol. 5 No.3 (2) Journal of International Academy of Physical Sciences pp. 33-37 A Bound on Weak Domination Number Using Strong (Weak) Degree Concepts in Graphs R. S. Bhat Manipal Institute
More informationZagreb indices of block-edge transformation graphs and their complements
Indonesian Journal of Combinatorics 1 () (017), 64 77 Zagreb indices of block-edge transformation graphs and their complements Bommanahal Basavanagoud a, Shreekant Patil a a Department of Mathematics,
More informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationarxiv: v1 [math.co] 23 Apr 2015
Connectivity of Double Grahs arxiv:504.0696v [math.co] 3 Ar 05 Zhayida Simayijiang and Elkin Vumar College of Mathematics and System Sciences Xinjiang University, Urumqi 830046, P.R.China Abstract The
More informationRelations between edge removing and edge subdivision concerning domination number of a graph
arxiv:1409.7508v1 [math.co] 26 Sep 2014 Relations between edge removing and edge subdivision concerning domination number of a graph Magdalena Lemańska 1, Joaquín Tey 2, Rita Zuazua 3 1 Gdansk University
More informationSQUARE DIFFERENCE 3-EQUITABLE LABELING FOR SOME GRAPHS. Sattur , TN, India. Sattur , TN, India.
International Journal of Science, Engineering Technology Research (IJSETR), Volume 5, Issue, March 2016 SQUARE DIFFERENCE -EQUITABLE LABELING FOR SOME GRAPHS R Loheswari 1 S Saravana kumar 2 1 Research
More informationIrredundance saturation number of a graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 46 (2010), Pages 37 49 Irredundance saturation number of a graph S. Arumugam Core Group Research Facility (CGRF) National Center for Advanced Research in Discrete
More informationIndependent Transversal Equitable Domination in Graphs
International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner
More informationRobust hamiltonicity of random directed graphs
Robust hamiltonicity of random directed grahs Asaf Ferber Rajko Nenadov Andreas Noever asaf.ferber@inf.ethz.ch rnenadov@inf.ethz.ch anoever@inf.ethz.ch Ueli Peter ueter@inf.ethz.ch Nemanja Škorić nskoric@inf.ethz.ch
More informationGraphoidal Tree d - Cover
International J.Math. Combin. Vol. (009), 66-78 Graphoidal ree d - Cover S.SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University, irunelveli 67 01, India) A.NAGARAJAN (Department of
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
More informationEdge Fixed Steiner Number of a Graph
International Journal of Mathematical Analysis Vol. 11, 2017, no. 16, 771-785 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7694 Edge Fixed Steiner Number of a Graph M. Perumalsamy 1,
More informationMaximum graphs with a unique minimum dominatingset
Discrete Mathematics 60 (003) 197 03 www.elsevier.com/locate/disc Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik,
More informationPermutability Degrees of Finite Groups
Filomat 30:8 (06), 65 75 DOI 0.98/FIL60865O Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: htt://www.mf.ni.ac.rs/filomat Permutability Degrees of Finite Grous
More informationOn the metric dimension of the total graph of a graph
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 4, 82 95 On the metric dimension of the total graph of a graph B. Sooryanarayana 1, Shreedhar
More informationHAUSDORFF MEASURE OF p-cantor SETS
Real Analysis Exchange Vol. 302), 2004/2005,. 20 C. Cabrelli, U. Molter, Deartamento de Matemática, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires and CONICET, Pabellón I - Ciudad Universitaria,
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationRANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES
RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete
More informationarxiv: v2 [math.na] 6 Apr 2016
Existence and otimality of strong stability reserving linear multiste methods: a duality-based aroach arxiv:504.03930v [math.na] 6 Ar 06 Adrián Németh January 9, 08 Abstract David I. Ketcheson We rove
More informationUpper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations Bommanahal Basavanagoud 1, a *, Shreekant Patil 2, b
Bulletin of Mathematical Sciences and Applications Submitted: 06-03- ISSN: 78-9634, Vol. 7, pp 0-6 Revised: 06-08-7 doi:0.805/www.scipress.com/bmsa.7.0 Accepted: 06-08-6 06 SciPress Ltd., Switzerland Online:
More informationSUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP OF THE NORMALIZER OF. 2p, p is a prime and p 1 mod4
Iranian Journal of Science & Technology, Transaction A, Vol. 34, No. A4 Printed in the Islamic Reublic of Iran, Shiraz University SUBORBITAL GRAPHS FOR A SPECIAL SUBGROUP * m OF THE NORMALIZER OF S. KADER,
More informationA structure theorem for product sets in extra special groups
A structure theorem for roduct sets in extra secial grous Thang Pham Michael Tait Le Anh Vinh Robert Won arxiv:1704.07849v1 [math.nt] 25 Ar 2017 Abstract HegyváriandHennecartshowedthatifB isasufficientlylargebrickofaheisenberg
More informationwhere x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H:
Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 2 October 25, 2017 Due: November 08, 2017 A. Growth function Growth function of stum functions.
More informationDEGREE SEQUENCES OF INFINITE GRAPHS
DEGREE SEQUENCES OF INFINITE GRAPHS ANDREAS BLASS AND FRANK HARARY ABSTRACT The degree sequences of finite graphs, finite connected graphs, finite trees and finite forests have all been characterized.
More informationMinimal dominating sets in maximum domatic partitions
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 52 (2012), Pages 281 292 Minimal dominating sets in maximum domatic partitions S. Arumugam K. Raja Chandrasekar National Centre for Advanced Research in Discrete
More informationRelationship between Maximum Flows and Minimum Cuts
128 Flows and Connectivity Recall Flows and Maximum Flows A connected weighted loopless graph (G,w) with two specified vertices x and y is called anetwork. If w is a nonnegative capacity function c, then
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More informationFurther results on relaxed mean labeling
Int. J. Adv. Appl. Math. and Mech. 3(3) (016) 9 99 (ISSN: 347-59) Journal homepage: www.ijaamm.com IJAAMM International Journal of Advances in Applied Mathematics and Mechanics Further results on relaxed
More informationUniversity of Alabama in Huntsville Huntsville, AL 35899, USA
EFFICIENT (j, k)-domination Robert R. Rubalcaba and Peter J. Slater,2 Department of Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899, USA e-mail: r.rubalcaba@gmail.com 2 Department
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationDUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary
DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES VALENTIN OVSIENKO AND SERGE TABACHNIKOV Abstract. We investigate a general method that allows one to construct new integer
More informationTHE ECCENTRIC CONNECTIVITY INDEX OF ARMCHAIR POLYHEX NANOTUBES
Macedonian Journal of Chemistry and Chemical Engineering, Vol., No.,. () MJCCA ISSN Received: August, UDC:. :.]:. Acceted: January, Original scientific aer THE ECCENTRIC CONNECTIVITY INDEX OF ARMCHAIR
More informationNew Information Measures for the Generalized Normal Distribution
Information,, 3-7; doi:.339/info3 OPEN ACCESS information ISSN 75-7 www.mdi.com/journal/information Article New Information Measures for the Generalized Normal Distribution Christos P. Kitsos * and Thomas
More informationVariations on Cops and Robbers
Variations on Cos and obbers Alan Frieze Michael Krivelevich Po-Shen Loh Abstract We consider several variants of the classical Cos and obbers game. We treat the version where the robber can move edges
More informationVariations on Cops and Robbers
Variations on Cos and obbers Alan Frieze Michael Krivelevich Po-Shen Loh Abstract We consider several variants of the classical Cos and obbers game. We treat the version where the robber can move > edges
More informationVertices contained in all or in no minimum k-dominating sets of a tree
AKCE Int. J. Graphs Comb., 11, No. 1 (2014), pp. 105-113 Vertices contained in all or in no minimum k-dominating sets of a tree Nacéra Meddah and Mostafa Blidia Department of Mathematics University of
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationMatching points with geometric objects: Combinatorial results
Matching oints with geometric objects: Combinatorial results Bernardo Ábrego1, Esther Arkin, Silvia Fernández 1, Ferran Hurtado 3, Mikio Kano 4, Joseh S. B. Mitchell, and Jorge Urrutia 1 Deartment of Mathematics,
More informationD.K.M.College for Women (Autonomous), Vellore , Tamilnadu, India.
American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 38-3491, ISSN (Online): 38-3580, ISSN (CD-ROM): 38-369
More informationOpposite-quadrant depth in the plane
Oosite-quadrant deth in the lane Hervé Brönnimann Jonathan Lenchner János Pach Comuter and Information Science, Polytechnic University, Brooklyn, NY 1101, hbr@oly.edu IBM T. J. Watson Research Center,
More informationDifference Cordial Labeling of Graphs Obtained from Double Snakes
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 3 (013), pp. 317-3 International Research Publication House http://www.irphouse.com Difference Cordial Labeling of Graphs
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationDouble domination edge removal critical graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
More informationMagic Graphoidal on Class of Trees A. Nellai Murugan
Bulletin of Mathematical Sciences and Applications Online: 2014-08-04 ISSN: 2278-9634, Vol. 9, pp 33-44 doi:10.18052/www.scipress.com/bmsa.9.33 2014 SciPress Ltd., Switzerland Magic Graphoidal on Class
More informationSTRONG TYPE INEQUALITIES AND AN ALMOST-ORTHOGONALITY PRINCIPLE FOR FAMILIES OF MAXIMAL OPERATORS ALONG DIRECTIONS IN R 2
STRONG TYPE INEQUALITIES AND AN ALMOST-ORTHOGONALITY PRINCIPLE FOR FAMILIES OF MAXIMAL OPERATORS ALONG DIRECTIONS IN R 2 ANGELES ALFONSECA Abstract In this aer we rove an almost-orthogonality rincile for
More information