Maximum graphs with a unique minimum dominatingset
|
|
- Lilian Reynolds
- 6 years ago
- Views:
Transcription
1 Discrete Mathematics 60 (003) Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik, RWTH-Aachen, 5056 Aachen, Germany Received January 001; received in revised form 5 September 001; accepted July 00 Abstract We present a conjecture on the maximum number of edges of a graph that has a unique minimum dominatingset. We verify our conjecture for some special cases and prove a weakened version of this conjecture in general. c 00 Elsevier Science B.V. All rights reserved. Keywords: Domination; Size; Unique minimum dominatingset; Extremal graphs 1. Introduction We will consider nite and simple graphs G =(V; E) and use standard graph-theoretical terminology. A dominating set of a graph G is a set of vertices D V such that V N[D; G]=N (D; G) D. The domination number is the minimum cardinality (G) of a dominatingset of G and a dominatingset of G of cardinality (G) isaminimum dominating set. A classical result of Vizing[9] states that a graph of order n and domination number has at most 1 (n )(n + ) edges. This result has been improved in various ways. Fulman [5] improved it by takinginto consideration the maximum degree of the graph and was able to shorten Sanchis s proof [8] of the fact that if the graph G has order n, domination number and maximum degree at most n 1, then G has at most 1 (n )(n + 1) edges (see also [7, Theorem.1]). Correspondingauthor. Tel.: ; fax: addresses: scherm@math.rwth-aachen.de (M. Fischermann), rauten@math.rwth-aachen.de (D. Rautenbach), volkm@math.rwth-aachen.de (L. Volkmann). 1 Supported by the Deutsche Forschungsgemeinschaft under grant Postdoktorandenstipendium RA 873/ X/03/$ - see front matter c 00 Elsevier Science B.V. All rights reserved. PII: S X(0)00670-
2 198 M. Fischermann et al. / Discrete Mathematics 60 (003) Fig. 1. In the present paper, we consider the analogous problem for graphs without isolated vertices that have a unique minimum dominating set. Unique minimum dominating sets have been studied, e.g. in [1 4,6]. Let m(n; ) denote the maximum number of edges of a graph G of order n without isolated vertices that has a unique minimum dominatingset of cardinality 1. The case where G is allowed to have isolated vertices obviously reduces to our results. If a graph G of order n without isolated vertices has a unique minimum dominating set D, then it is easy to see that the private exterior neighbourhood epn (v; D; G)=N (v; G)\N [D\{v};G]ofv with respect to D contains at least two vertices for each vertex v D. This observation implies that n 3(G). We propose the followingconjecture. Conjecture 1. If 1 and n 3, then n n 1 ; =1; m(n; )= n (n + 5 n )= ( ); : We rst show that m(n; ) is at least as large as stated in Conjecture 1 by exhibiting (possible) extremal graphs. In Section, we verify Conjecture 1 for = 1 and n =3. Finally, in Section 3, we prove a weakened version of Conjecture 1 for. For 1 and n 3 we dene the graph G(n; ). If = 1, then the edge set of the complement of G(n; ) consists of (n 1)= independent edges if n is odd and of (n 4)= independent edges and a path on three vertices if n is even. Fig. 1 shows the graphs G(3; 1), G(4; 1) and G(5; 1). If, then G(n; )=(V; E) has vertex set V = D P R for disjoint sets D = {x 1 ;x ; :::;x }, P = {y i ;z i 16i6} and R. For 16i6 we have N[x i ;G(n; )] = D {y i ;z i } R, N(y i ;G(n; )) = {x i } and N [z i ;G(n; )] = {x i } {z 1 ;z ;:::;z } R. Furthermore, the subgraph G(n; )[R] ofg that is induced by the set R is a complete graph. Fig. shows the graphs G(7; ) and G(10; 3). It is easy to verify that the graph G(n; ) has a unique minimum dominatingset of cardinality. Furthermore, if = 1, then G(n; ) has ( n ) (n 1)= edges and, if, then G(n; ) has ( n ) (n +( 5)=) edges. This implies that n n 1 ; =1; m(n; ) n (n + 5 ); :
3 M. Fischermann et al. / Discrete Mathematics 60 (003) Fig... Some special cases It is easy to verify Conjecture 1 for = 1 as follows. Let G be a graph of order n without isolated vertices that has a unique minimum dominatingset of cardinality = 1. Since G has a unique vertex of degree n 1 and all remainingvertices have degree at most n, the desired bound follows. Note that if a graph G of order n without isolated vertices has a unique minimum dominatingset of cardinality, then its maximum degree is at most n 1 and Sanchis s result implies that G has at most ( n +1 ) edges which is larger than the bound given in Conjecture 1. The next special case that we consider is n =3. Theorem 1. Let G =(V; E) be a graph without isolated vertices with a unique minimum dominating set of cardinality and order n =3. Then m = E 6 ( n n + 5 ) = + : Proof. Let D = {x 1 ;x ;:::;x } be the unique minimum dominatingset of G and let P i = epn(x i ;D;G) for 16i6. Since P i for 16i6 and n =3, we have P i = for 16i6. Let P i = {p i;p i } for 16i6. If there is some 16i6 such that p ip i E, then (D\{x i }) {p i} D is a minimum dominatingset of G, which is a contradiction. If there are some 16j k6 such that there are two independent edges between P i and P j, say p ip j;p i p j E, then (D\{x i ;x j }) {p i;p j } D is a minimum dominating set of G, which is a contradiction. If there are some 16i j6 such that x i x j, p ip j and p ip j E, then (D\{x j }) {p i} D is a minimum dominatingset of G, which is a contradiction. This implies that for all 16i j6 there are at most two edges between P i and P j and if there are two such edges, then they are incident. Furthermore, if x i x j E, then there is at most one edge between P i and P j. Let l for l 0 be the number of pairs {i; j} with 16i j6 such that there are exactly l edges between P i and P j. By the above reasonings, we obtain that l = 0 for
4 00 M. Fischermann et al. / Discrete Mathematics 60 (003) all l 3 and m(g[d]) This implies that m = E = + m(g[d]) ( ) = + : This completes the proof. 3. A weakened version of Conjecture 1 In order to motivate the weakened version of Conjecture 1, we dene the following property of graphs: A graph G without isolated vertices is said to have property ( ), if G has a minimum dominatingset D such that there is no set D V dierent from D with D = D and epn(x; D; G) N [D ;G]; x D i.e. no set of (G)= D vertices that is dierent from D dominates the private exterior neighbourhoods of the vertices in D. Let m(n; ) denote the maximum number of edges of a graph G of order n without isolated vertices that has domination number and property ( ). It is easy to see that the graph G(n; ) has property ( ). Furthermore, a graph G that has property ( ) also has a unique minimum dominatingset. For this implies ( n n + 5 ) 6 m(n; )6m(n; ): We will now prove the followingtheorem. Theorem. If, then m(n; )=( n ) (n +( 5)=). Proof. It remains to prove that m(n; )6( n ) (n +( 5)=). Therefore, let G be a graph of order n without isolated vertices that has domination number and property ( ). Let D = {x 1 ;x ;:::;x } be the unique minimum dominatingset and for 16i6 let P i = epn(x i ;D;G). As above P i for 16i6. Let R = V \(D P i). Let n 0 = R and n i = P i for 16i6. We assume that n 1 n n 3 n. We will estimate the number of edges of G.
5 M. Fischermann et al. / Discrete Mathematics 60 (003) There are exactly n i edges between D and P i. There are at most ( )+ ( n0 )+n 0 edges in G[D R]. Let 16i6. Since there is no vertex p i P i such that P i N[p i ;G], there are at most ( ni ) n i= edges in G[P i ]. Since there is no vertex r i R such that P i N (r i ;G), there are at most n 0 (n i 1) edges between P i and R. Now let 16i j6. Since there is no vertex p i P i such that P j N(p i ;G), there are at most n i (n j 1) edges between P i and P j. Furthermore, if n i =, then also n j = and it is easy to see that there is at most one edge between P i and P j. Altogether we obtain that m = E 6f(n 0 ;n 1 ;:::;n ) for a function f dened as follows: f(n 0 ;n 1 ;:::;n )= = n i n0 + n 0 + (n 0 n i n 0 )+ n ( 1) 16i j6 n i ( ) ni ni (n i n j max{n i ; 3}) ni n 0 ( i) max{n i ; 3}: Claim. Let, n i for 16i6 and n 0 0 be integers. Let n = + i=0 n i and let n 1 n n 3 n. If =, n 1 = n 4, n 1 and n are even, then f(n 0 ;n 1 ;:::;n )6 ( n n + 5 ) +1: Otherwise ( n f(n 0 ;n 1 ;:::;n )6 n + 5 ) : Proof of claim. If there is some 16i6 1 such that n i 4 and n i n i+1, then f(n 0 ;n 1 ;:::;n i ;:::;n ) 6 f(n 0 +1;n 1 ;:::;n i 1;:::;n ) ( 1) ni + ni 1 + ( i) 6 f(n 0 +1;n 1 ;:::;n i 1;:::;n ): Similarly, if = and n 1 n +, then f(n 0 ;n 1 ;n ) f(n 0 +;n 1 ;n ) and, if =, n 1 = n + 1 and n is even, then f(n 0 ;n 1 ;n ) f(n 0 +1;n 1 1;n ).
6 0 M. Fischermann et al. / Discrete Mathematics 60 (003) We will consider two special cases. First, let n 1 = n = = n l = 3 and n l+1 = n l+ = = n = for some 06l6. We obtain n f(n 0 ;n 1 ;:::;n )= ( 1)( + l) ( + l) (n (3 + l)) 3 ( 1 ) ( +1) = ( n n + 5 ) : Now let n 1 = n = = n 4: For = 1 [n 1 (mod )] we obtain n f(n 0 ;n 1 ;:::;n )= ( 1)n 1 n1 n 0 ( 1 ) ( +1) n 1 n = ( 1)n 1 n 1 n 0 ( 1 ) ( +1) n 3 = 1 n 1 n 0 n 3 = 1 n 1 (n (n 1 +1)) n 1 = 1 n 1 (n ) n 6 ( 4) (n ) = ( n ) (n + 4) : If = and n 1 = n 5 are odd or if 3, then this implies f(n 0 ;n 1 ;:::;n )6( n ) (n +( 5)=). If = and n 1 = n are even, then this implies f(n 0 ;n 1 ;n )6( n ) (n +( 5)=)+1. In view of the above remarks, this completes the proof of the claim. n 1 In order to complete the proof of the theorem, it remains to consider the case where =, n 1 = n 4, n 1 and n are even and m = f(n 0 ;n 1 ;:::;n ). In this case, G[P 1 ] and G[P ] are complete graphs in which perfect matchings have been removed and G[P 1 ;P ] is a complete bipartite graph in which a perfect matching has been removed. (The graph G[P 1 ;P ] has vertex set P 1 P and contains all edges of G that join a vertex in P 1 and a vertex in P.) If D = {p 1 ;p 1 } consists of two non-adjacent vertices in P 1, then (P 1 P ) N [D ;G] which is a contradiction. Hence if =, n 1 = n 4, n 1
7 M. Fischermann et al. / Discrete Mathematics 60 (003) and n are even, then m6f(n 0 ;n 1 ;:::;n ) 1. In view of the claim, this completes the proof. References [1] M. Fischermann, Block graphs with unique minimum dominating sets, Discrete Math. 40 (001) [] M. Fischermann, D. Rautenbach, L. Volkmann, A note on the complexity of graph parameters and the uniqueness of their realizations, J. Combin. Math. Combin. Comput. [3] M. Fischermann, L. Volkmann, Unique minimum domination in trees, Australas. J. Combin. 5 (00) [4] M. Fischermann, L. Volkmann, Cactus graphs with unique minimum dominating sets, Utilitas Math., to appear. [5] J. Fulman, A generalization of Vizing s theorem on domination, Discrete Math. 16 (1994) [6] G. Gunther, B. Hartnell, L.R. Markus, D. Rall, Graphs with unique minimum dominatingsets, Congr. Numer. 101 (1994) [7] T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, [8] L.A. Sanchis, Maximum number of edges in connected graphs with a given domination number, Discrete Math. 87 (1991) [9] V.G. Vizing, A bound on the external stability number of a graph, Dokl. Akad. Nauk. SSSR 164 (1965)
Applied 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 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 informationRoman domination perfect graphs
An. Şt. Univ. Ovidius Constanţa Vol. 19(3), 2011, 167 174 Roman domination perfect graphs Nader Jafari Rad, Lutz Volkmann Abstract A Roman dominating function on a graph G is a function f : V (G) {0, 1,
More informationOn the reconstruction of the degree sequence
Discrete Mathematics 259 (2002) 293 300 www.elsevier.com/locate/disc Note On the reconstruction of the degree sequence Charles Delorme a, Odile Favaron a, Dieter Rautenbach b;c; ;1 a LRI, Bât. 490, Universite
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
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 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 informationLower bounds on the minus domination and k-subdomination numbers
Theoretical Computer Science 96 (003) 89 98 www.elsevier.com/locate/tcs Lower bounds on the minus domination and k-subdomination numbers Liying Kang a;, Hong Qiao b, Erfang Shan a, Dingzhu Du c a Department
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
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 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 informationA Note on an Induced Subgraph Characterization of Domination Perfect Graphs.
A Note on an Induced Subgraph Characterization of Domination Perfect Graphs. Eglantine Camby & Fränk Plein Université Libre de Bruxelles Département de Mathématique Boulevard du Triomphe, 1050 Brussels,
More informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
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 informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 07/06 Cyclic sums, network sharing and restricted edge cuts in graphs with long cycles Rautenbach, Dieter; Volkmann, Lutz 2007 Impressum:
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 informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. No. 1, 017 pp.35-1 DOI: 10.09/CCO.017.1359 CCO Commun. Comb. Optim. Sufficient conditions for maximally edge-connected and super-edge-connected graphs
More informationMinimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science 290 (2003) 2109 2120 www.elsevier.com/locate/tcs Note Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard Irene Charon, Olivier Hudry, Antoine
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 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 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 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 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,A)
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 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 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 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 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 informationPancyclicity in claw-free graphs
Discrete Mathematics 56 (00) 151 160 www.elsevier.com/locate/disc Pancyclicity in claw-free graphs R.J. Gould, F. Pfender Department of Mathematics and Computer Science, Emory University, Atlanta, GA 303,
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 informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
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 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 informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationProblems in Domination and Graph Products
Clemson University TigerPrints All Dissertations Dissertations 5-2016 Problems in Domination and Graph Products Jason Todd Hedetniemi Clemson University, jason.hedetniemi@gmail.com Follow this and additional
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 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 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 informationRelating 2-rainbow domination to weak Roman domination
Relating 2-rainbow domination to weak Roman domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.04901v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
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 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 informationOn Domination Critical Graphs with Cutvertices having Connected Domination Number 3
International Mathematical Forum, 2, 2007, no. 61, 3041-3052 On Domination Critical Graphs with Cutvertices having Connected Domination Number 3 Nawarat Ananchuen 1 Department of Mathematics, Faculty of
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
More informationOn graphs with a local hereditary property
Discrete Mathematics 236 (2001) 53 58 www.elsevier.com/locate/disc On graphs with a local hereditary property Mieczys law Borowiecki a;, Peter Mihok b a Institute of Mathematics, Technical University of
More informationDiscrete Mathematics. Kernels by monochromatic paths in digraphs with covering number 2
Discrete Mathematics 311 (2011) 1111 1118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Kernels by monochromatic paths in digraphs with covering
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 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 informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
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 informationarxiv: v1 [math.co] 7 Aug 2017
Locally Searching for Large Induced Matchings Maximilian Fürst, Marilena Leichter, Dieter Rautenbach arxiv:1708.008v1 [math.co] 7 Aug 017 Institut für Optimierung und Operations Research, Universität Ulm,
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
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 informationCycles of length 1 modulo 3 in graph
Discrete Applied Mathematics 113 (2001) 329 336 Note Cycles of length 1 modulo 3 in graph LU Mei, YU Zhengguang Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China Received
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 informationRealization of set functions as cut functions of graphs and hypergraphs
Discrete Mathematics 226 (2001) 199 210 www.elsevier.com/locate/disc Realization of set functions as cut functions of graphs and hypergraphs Satoru Fujishige a;, Sachin B. Patkar b a Division of Systems
More informationDOMINATION 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
Journal of Analysis and Comutation, Vol 8, No 1, (January-June 2012) : 1-8 ISSN : 0973-2861 J A C Serials Publications DOMINATION IN DEGREE SPLITTING GRAPHS B BASAVANAGOUD 1*, PRASHANT V PATIL 2 AND SUNILKUMAR
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 informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
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 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 informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
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 lower bound on the order of the largest induced linear forest in triangle-free planar graphs
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs François Dross a, Mickael Montassier a, and Alexandre Pinlou b a Université de Montpellier, LIRMM b Université
More informationNote Coveringhypercubes by isometric paths
Discrete Mathematics 240 (2001) 253 260 www.elsevier.com/locate/disc Note Coveringhypercubes by isometric paths Shannon L. Fitzpatrick a, Richard J. Nowakowski b;, Derek Holton c, Ian Caines b a Acadia
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 informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationON INTEGER DOMINATION IN GRAPHS AND VIZING-LIKE PROBLEMS. Boštjan Brešar, 1 Michael A. Henning 2 and Sandi Klavžar 3 1.
TAIWANESE JOURNAL OF MATHEMATICS Vol. 10, No. 5, pp. 1317-1328, September 2006 This paper is available online at http://www.math.nthu.edu.tw/tjm/ ON INTEGER DOMINATION IN GRAPHS AND VIZING-LIKE PROBLEMS
More informationKey words. silver matrix, graph colouring, coding theory, domination in graphs, finite projective
Silver Cubes Mohammad Ghebleh 1, Luis A. Goddyn 1, Ebadollah S. Mahmoodian 2, Maryam Verdian-Rizi 1 1 Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6, Canada 2 Department of Mathematical
More informationDominating a family of graphs with small connected subgraphs
Dominating a family of graphs with small connected subgraphs Yair Caro Raphael Yuster Abstract Let F = {G 1,..., G t } be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationCharacterization of total restrained domination edge critical unicyclic graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 77 82 Characterization of total restrained domination edge critical unicyclic graphs Nader Jafari Rad School of Mathematics Institute for Research
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationConnectivity of local tournaments
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (01) Pages 71 79 Connectivity of local tournaments Yubao Guo Andreas Holtkamp Sebastian Milz Lehrstuhl C für Mathematik RWTH Aachen University 5056 Aachen
More informationON DOMINATION IN CUBIC GRAPHS
R u t c o r Research R e p o r t ON DOMINATION IN CUBIC GRAPHS Alexander K. Kelmans a RRR 28-2006, NOVEMBER, 2006 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew Road Piscataway,
More informationMaximum Alliance-Free and Minimum Alliance-Cover Sets
Maximum Alliance-Free and Minimum Alliance-Cover Sets Khurram H. Shafique and Ronald D. Dutton School of Computer Science University of Central Florida Orlando, FL USA 3816 hurram@cs.ucf.edu, dutton@cs.ucf.edu
More informationp-liar s Domination in a Graph
Applied Mathematical Sciences, Vol 9, 015, no 107, 5331-5341 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ams0155749 p-liar s Domination in a Graph Carlito B Balandra 1 Department of Arts and Sciences
More informationDomination in Cayley Digraphs of Right and Left Groups
Communications in Mathematics and Applications Vol. 8, No. 3, pp. 271 287, 2017 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com Domination in Cayley
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
More informationWell-covered graphs and factors
Discrete Applied Mathematics 154 (2006) 1416 1428 www.elsevier.com/locate/dam Well-covered graphs and factors Bert Randerath a,, Preben Dahl Vestergaard b a Institut für Informatik, Universität zu Köln,
More informationOn a kind of restricted edge connectivity of graphs
Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,
More informationTransactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationk-tuple Total Domination in Supergeneralized Petersen Graphs
Communications in Mathematics and Applications Volume (011), Number 1, pp. 9 38 RGN Publications http://www.rgnpublications.com k-tuple Total Domination in Supergeneralized Petersen Graphs Adel P. Kazemi
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Bohdan Zelinka Signed total domination number of a graph Czechoslovak Mathematical Journal, Vol. 5 (200), No. 2, 225 229 Persistent URL: http://dml.cz/dmlcz/27643 Terms
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationNew bounds on the signed domination numbers of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 61(3) (015), Pages 73 80 New bounds on the signed domination numbers of graphs S.M. Hosseini Moghaddam Department of Mathematics Qom Branch, Islamic Azad University
More informationProperties of independent Roman domination in graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 5 (01), Pages 11 18 Properties of independent Roman domination in graphs M. Adabi E. Ebrahimi Targhi N. Jafari Rad M. Saied Moradi Department of Mathematics
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
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 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 informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationRoman dominating influence parameters
Roman dominating influence parameters Robert R. Rubalcaba a, Peter J. Slater b,a a Department of Mathematical Sciences, University of Alabama in Huntsville, AL 35899, USA b Department of Mathematical Sciences
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More information