Note on Strong Roman Domination in Graphs
|
|
- Alban Bruce
- 5 years ago
- Views:
Transcription
1 Applied Mathematical Sciences, Vol. 12, 2018, no. 11, HIKARI Ltd, Note on Strong Roman Domination in Graphs Jiaxue Xu and Zhiping Wang Department of Mathematics, Dalian Maritime University Dalian, P. R.China Copyright 2018 Jiaxue Xu and Zhiping Wang. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract A strong Roman dominating function (StRDF) for a graph G = (V, E), is a function f : V (G) {0, 1,..., 2 + 1} such that every vertex v B 0 has a neighbor w, and w B 2 and f(w) N(w) B 0, where B j = {v V : f(v) = j} for j = 0, 1 and B 2 = V \(B 0 B1 ) = {v V : f(v) 2}. The strong Roman domination number γ StR (G) of G is the minimum of v V (G) f(v) over such functions. A strong Roman dominating function of G of weight γ StR (G) is called a γ StR (G)-function. M.P.Alvarez et al. [T. Mediavilla- Gradolph, S.M. Sheikholeslami, J.C. Valenzuela-Tripodoro, I.G. Yero, On the strong Roman domination number of graphs, Discrete Applied Mathematics 21(201)44-59] posed the following question: It is true that γ StR (G) 6n for any connected graph G of order n? We solved this part of the problem. In this paper, we prove that strong Roman domination number of some special graphs satisfying γ StR (G) 6n, such as middle graph of fan graph, graphs formed by meridian and latitude lines on a sphere and graph D p,cq, among others. Mathematics Subject Classification: 05C69 Keywords: strong Roman domination number, graph D p,cq, middle graph of fan graph 1 Introduction The definition of a Roman dominating function was motivated by an article in Scientific American by Ian Stewart entitled Defend the Roman Em- Corresponding author
2 56 Jiaxue Xu and Zhiping Wang pire. Cockayne, Dreyer, Hedetnieni, and Hedetniemi [1] defined a Roman dominating function on a graph G = (V, E) to be function f : V {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF is the value f(v (G)) = u V (G) f(u). The Roman domination number is the minimum weight of an RDF in G. The definition of a Roman dominating function is given implicitly in [2] and []. There are some known results regarding Roman domination number (see Refs. [4-]). Meanwhile, many researches initiate the study of a new parameters related to Roman domination number and begin with the study of several mathematical properties of this variants. For instance, we mention variants like the following ones: strong Roman domination [8], perfect Roman domination [9], Roman 2-domination [10], independent 2-rainbow domination [11], weak Roman domination [], among others. Although the Roman domination strategy can deal with some simple situation, but if several simultaneous attacks to weak places occur, a single stronger place will be not able to defend its neighbors efficiently, thus they fails against a multiple attack situation. With this motivation in mind, the strong Roman domination in graphs was introduced by M.P.Alvarez et al. A graph of order and maximum degree. Let B j = {v V : f(v) = j} for j = 0, 1 and B 2 = V \(B 0 B1 ) = {v V : f(v) 2}. A strong Roman dominating function (StRDF for short) on a graph G = (V, E) is a function f : V (G) {0, 1,..., 2 + 1} satisfying the condition that every vertex v B 0 has a neighbor w, such that w B 2 and f(w) N(w) B 0. Comparing with Roman dominating, strong Roman domination defensive strategy needs more legions than it, so the advantage is not to save resources but to design a stronger empire against external attacks. Under the strong Roman dominating strategy, any strong vertex must be able to defend itself and at least one half of its weak neighbors. At the same time, M.P.Alvarez et al show that the decision problem regarding the computation of the strong Roman domination number is NP-complete, even when restricted to bipartite graphs. Moreover, they obtain several bounds on such a parameter and give some realizability results for it. For instances, they prove that for any tree T of order n. The present paper is organized as follows. In Section 2, we list some necessary notation we shall use throughout this paper. In Section, we prove that strong Roman domination number of some special graphs satisfying γ StR (G) 6n, such as middle graph of fan graph, graphs formed by meridian and latitude lines on a sphered and graph D p,cq, among others.
3 Note on strong Roman domination in graphs 5 2 Notation For notation and graph theory terminology in general we follow [1]. To begin with our work, we first introduce the terminology and notation we shall use throughout this paper. All graphs considered in this paper are undirected, finite and simple. Connectivity is perhaps the most fundamental graph-theoretic property. G is a simple graph with vertex set V (G) and edge set E(G) (briefly V and E). The order V of G is denoted by n and the order E of G is denoted by m. For every vertex v V, the open neighborhood N(v) is {u V (G) uv E(G)} and the closed neighborhood of V is the set N[v] = N(v) {v}. If S is a subset of V (G) then N(S) = v S N(v), N[S] = N(S) S and the subgraph induced by S in G is denoted G[S]. Respectively, the degree of v is d(v) = N(v). By δ = δ(g), we denote the maximum degree of the graph G. Main results The graph D p,cq [10] consists of p cycles with one common vertex, which denoted by v 1. And each cycle has q vertices besides the center point v 1. The principle of labelling vertices of the D p,cq graph is the first of the common vertex is labeled, the following each cycle is labelled in proper sequence. See Figure 1. Figure 1: The graph D p,c6 Theorem.1. Let D p,cq graph with order n. Then γ StR (D p,cq ) 6n. Proof. It is straightforward to observe that the number of vertices are n = (q 1)p+1 and m = pq edges. Then the average of degree is d = 2pq. The (q 1)p+1 graph D p,cq N[v 1 ] consists of p paths P q, and we let g(x) is γ StR (P q ) function, such that x V (P q ). So we can draw the strong Roman domi-
4 58 Jiaxue Xu and Zhiping Wang nation number of each paths P q is γ StR (P q ) = w(g(x)) = 2(q ). Now define a function f : V (G) {0, 1,..., (G) + 1} on G as follows: f(v 2 1 ) = 1+ 2p = 1+p, f(u) = 0 for every vertex u N(v 2 1), f(x) = g(x) to remaining vertexes. Clearly f is a strong Roman dominating function of graph D p,cq and implies thst 2(q ) γ StR (D p,cq ) w(f) = p p 2(q ) p + p = 1 + 2pq 2p < 6n. Therefore, the proof is complete. The principle of labelling vertices of the spider web graph W (p, q) is the first of the common vertex is labeled, the following each cycle is labelled in proper sequence. See Figure 2. Figure 2: The spider web graph W(2,4) Theorem.2. Let W (p, q) a spider web graph with order n, Then γ StR (W (p, q)) 6n. Proof. Observe that V (W (p, q)) = q(p + 1) + 1. Consider the following five subcases. Case 1: Let p 1, q = 1. It is obvious that graph W (p, q) is a path. According to theorem previously, we can obtain that γ StR (W (p, q) < 6n. Case 2 :Let p = 1, q = 2. There are n = 5. Now we define f : V (G) {0, 1,..., + 1} on V (W (p, q)) as follows: f(x 2 0) = 2, f(u) = 0 for each vertexes u N(x 0 ), and f(v) = 1 to remaining vertexes. Clearly f is a StRDF of W (p, q) of weight w(f) = = 4. Using the fact that γ StR (W (p, q)) w(f) = 4 < 0.
5 Note on strong Roman domination in graphs 59 Case : Let p = 1, q. There are n = 2q + 1. Now we define f : V (G) {0, 1,..., + 1} on V (W (p, q)) as follows: f(x 2 0) = 1 + q, f(u) = 0 for 2 each vertexes u N(x 0 ), and f(v) = 1 to remaining vertexes. Therefore f is a StRDF of W (p, q) of weight w(f) = 1 + q + q, and we deduce that 2 γ StR (W (p, q)) w(f) = 1 + q 2 + q 1 + q q 2 = q < 6n. Case 4 : Let p = 2, q 2. There are n = q + 1. Now we define f : V (G) {0, 1,..., +1} on V (W (p, q)) as follows: f(v) = 2 for every vertexes v C 2 q 2, f(u) = 0 for each vertexes u N(v), and f(x 0 ) = 1. Obviously f is a StRDF of W (p, q) of weight w(f) = 1 + 2q and γ StR (W (p, q)) w(f) = 1 + 2q < 6n. Case 5 : Let p, q 2. According to the definition of spider web graph, there are p circle C q. We name these circles. From inside to outside, the circles were named as C q1, C q2,..., C qp. Now we define f : V (G) {0, 1,..., + 1} 2 on V (W (p, q)) as follows: f(v) = 2 for each vertexes v C qp, f(x) = 0 to vertices x N(v), f(u) = 1 + q to x 2 0, and f(x) = 0 to every vertices x q 1. We can obtain that γ StR (C q ) = 2q, so we have C q 2 =... = C qp 2 = 2q. Clearly f is a StRDF of W (p, q) of weight w(f) = 2q + (p ) 2q q 2 and we deduce that Because γ StR (W (p, q)) w(f) = 2q + (p ) 2q q 2 2q + (p )( 2q + 1 ) + n + 2 = 2pq + p + q < 6n. 6n 2pq + p + q = 4pq q 14 p 9 14 = ( 4n )m + 5n > 0. Therefore, the proof is complete. The principle of labelling vertices of the middle graph of fan graph M(F p ) is the first of the common vertex is labeled, the following each vertexes is labelled in proper sequence. See Figure. Theorem.. Let M(F p ) a middle graph of fan graph with order n, Then γ StR (M(F p )) 6n. Proof. Observe that V (M(F p )) = p. Let f(v 0 ) = 1 + p 1 2 and f(v 01) =
6 540 Jiaxue Xu and Zhiping Wang Figure : The middle graph of fan graph 1+ p 2, 0 to N(v 2 01) N(v 0 ). We can see the remaining vertexes as a P (p 2) path. Assuming g(x) is the γ StR (P (p 2)) function, and we let f(x) = g(x) to remaining vertexes. Clearly f is a StRDF of W (p, q) of weight w(f) = 1 + p p 2 + 2p 4. And we have 2 2 γ StR (M(F p )) w(f) = 1 + p p p p p 1 = 5p < 6n. It follows that 18p 18 5p 1 = 19p 2 Consequently, the proof is complete. 4 Conclusion M. P. Alvarez et al. posed the following question: It is true that γ StR (G) 6n for any connected graph G of order n? We should find more special graphs to prove it or search some graphs overturn the conclusion. References [1] Ernie J. Cockayne, Paul A. Dreyer, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Roman domination in graphs, Discrete Mathematics, 28 (2000), no. 1, [2] C. S. Revelle, K. E. Rosing, Defendens Imperium Romanum: A Classical Problem in Military Strategy, American Mathematical Monthly, 10 (2000),
7 Note on strong Roman domination in graphs 541 no., [] I. Stewart, Defend the Roman Empire!, Scientific American, 281 (1999), no. 6, [4] M. A. Henning, S. T. Hedetniemi, Defending the Roman Empire-A new strategy, Discrete Mathematics, 266 (200), no. 1, [5] M. A. Henning, Defending the Roman Empire from Multiple Attacks, Elsevier Science Publishers B. V [6] O. Favaron, H. Karami, R. Khoeilar, S.M. Sheikholeslami, On the Roman domination number of a graph, Discrete Mathematics, 09 (2009), no. 10, [] T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, [8] M. P. lvarez-ruiz, T. Mediavilla-Gradolph, S. M. Sheikholeslami, J.C. Valenzuela-Tripodoro, I.G. Yero, On the strong Roman domination number of graphs, Discrete Applied Mathematics, 21 (201), [9] M. A. Henning, W. F. Klostermeyer, G. Macgillivray, Perfect Roman domination in trees, Discrete Applied Mathematics, 26 (2018), [10] M. Chellali, T. W. Haynes, S. T. Hedetniemi, Alice A. McRae, Roman 2-domination, Discrete Applied Mathematics, 2014 (2016), [11] A. Rahmouni, M. Chellali, Independent Roman 2 -domination in graphs, Discrete Applied Mathematics, 26 (2018), Received: April 2, 2018; Published: May 15, 2018
Properties 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 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 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 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 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 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 informationSecure Connected Domination in a Graph
International Journal of Mathematical Analysis Vol. 8, 2014, no. 42, 2065-2074 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.47221 Secure Connected Domination in a Graph Amerkhan G.
More informationRestrained Weakly Connected Independent Domination in the Corona and Composition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 20, 973-978 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121046 Restrained Weakly Connected Independent Domination in the Corona and
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 informationOn k-rainbow independent domination in graphs
On k-rainbow independent domination in graphs Tadeja Kraner Šumenjak Douglas F. Rall Aleksandra Tepeh Abstract In this paper, we define a new domination invariant on a graph G, which coincides with the
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 informationLocating-Dominating Sets in Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 88, 4381-4388 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46400 Locating-Dominating Sets in Graphs Sergio R. Canoy, Jr. 1, Gina A.
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 informationDouble Total Domination on Generalized Petersen Graphs 1
Applied Mathematical Sciences, Vol. 11, 2017, no. 19, 905-912 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.7114 Double Total Domination on Generalized Petersen Graphs 1 Chengye Zhao 2
More informationSupervisor: Prof.Koh Khee Meng Mentor: Mr.Dennis Yeo
HWA CHONG INSTITUTION, SINGAPORE Roman Domination Wang Shizhi Supervisor: Prof.Koh Khee Meng Mentor: Mr.Dennis Yeo 171 Roman Domination Abstract In his article Defend the Roman Empire! (1999), Ian Stewart
More informationExtremal Problems for Roman Domination
Extremal Problems for Roman Domination Erin W Chambers, Bill Kinnersley, Noah Prince, Douglas B West Abstract A Roman dominating function of a graph G is a labeling f : V (G) {0, 1, 2} such that every
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 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 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 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 informationThe Rainbow Connection of Windmill and Corona Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6367-6372 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48632 The Rainbow Connection of Windmill and Corona Graph Yixiao Liu Department
More informationA Note on Roman {2}-domination problem in graphs
A Note on Roman {2}-domination problem in graphs arxiv:1804.09338v3 [math.co] 17 Feb 2019 Hangdi Chen and Changhong Lu School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal
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 informationDouble Total Domination in Circulant Graphs 1
Applied Mathematical Sciences, Vol. 12, 2018, no. 32, 1623-1633 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.811172 Double Total Domination in Circulant Graphs 1 Qin Zhang and Chengye
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 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 informationH Paths in 2 Colored Tournaments
International Journal of Contemporary Mathematical Sciences Vol. 10, 2015, no. 5, 185-195 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2015.5418 H Paths in 2 Colo Tournaments Alejandro
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 informationRainbow Connection Number of the Thorn Graph
Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6373-6377 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48633 Rainbow Connection Number of the Thorn Graph Yixiao Liu Department
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 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 informationAnother Look at p-liar s Domination in Graphs
International Journal of Mathematical Analysis Vol 10, 2016, no 5, 213-221 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma2016511283 Another Look at p-liar s Domination in Graphs Carlito B Balandra
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 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 informationGraceful Labeling for Complete Bipartite Graphs
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department
More informationSecure Weakly Connected Domination in the Join of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 14, 697-702 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.519 Secure Weakly Connected Domination in the Join of Graphs
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 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 informationSecure Weakly Convex Domination in Graphs
Applied Mathematical Sciences, Vol 9, 2015, no 3, 143-147 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams2015411992 Secure Weakly Convex Domination in Graphs Rene E Leonida Mathematics Department
More informationLocating Chromatic Number of Banana Tree
International Mathematical Forum, Vol. 12, 2017, no. 1, 39-45 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.610138 Locating Chromatic Number of Banana Tree Asmiati Department of Mathematics
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 informationDominator Colorings and Safe Clique Partitions
Dominator Colorings and Safe Clique Partitions Ralucca Gera, Craig Rasmussen Naval Postgraduate School Monterey, CA 994, USA {rgera,ras}@npsedu and Steve Horton United States Military Academy West Point,
More informationON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS
Commun. Korean Math. Soc. 9 (014), No., pp. 359 366 http://dx.doi.org/10.4134/ckms.014.9..359 ON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS WenSheng Li, Huaming Xing, and Moo Young Sohn Abstract. A three-valued
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 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 informationOn Two New Classes of Fibonacci and Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
Applied Mathematical Sciences Vol. 207 no. 25 2-29 HIKARI Ltd www.m-hikari.com https://doi.org/0.2988/ams.207.7392 On Two New Classes of Fibonacci Lucas Reciprocal Sums with Subscripts in Arithmetic Progression
More informationRoot Square Mean Labeling of Some More. Disconnected Graphs
International Mathematical Forum, Vol. 10, 2015, no. 1, 25-34 HIKARI Ltd,www.m-hikari.com http://dx.doi.org/10.12988/imf.2015.411196 Root Square Mean Labeling of Some More Disconnected Graphs S. S. Sandhya
More informationAveraging 2-Rainbow Domination and Roman Domination
Averaging 2-Rainbow Domination and Roman Domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.0899v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationFractional Roman Domination
Chapter 6 Fractional Roman Domination It is important to discuss minimality of Roman domination functions before we get into the details of fractional version of Roman domination. Minimality of domination
More informationROOT SQUARE MEAN GRAPHS OF ORDER 5
Available online at http://scik.org J. Math. Comput. Sci. 5 (2015), No. 5, 708-715 ISSN: 1927-5307 ROOT SQUARE MEAN GRAPHS OF ORDER 5 S.S. SANDHYA 1 S. SOMASUNDARAM 2 AND S. ANUSA 3,* 1 Department of Mathematics,
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 informationOn the Laplacian Energy of Windmill Graph. and Graph D m,cn
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 9, 405-414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.6844 On the Laplacian Energy of Windmill Graph
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 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 Note of the Strong Convergence of the Mann Iteration for Demicontractive Mappings
Applied Mathematical Sciences, Vol. 10, 2016, no. 6, 255-261 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.511700 A Note of the Strong Convergence of the Mann Iteration for Demicontractive
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 informationResearch Article k-tuple Total Domination in Complementary Prisms
International Scholarly Research Network ISRN Discrete Mathematics Volume 2011, Article ID 68127, 13 pages doi:10.502/2011/68127 Research Article k-tuple Total Domination in Complementary Prisms Adel P.
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 informationSecure Domination in Graphs
Int. J. Advance Soft Compu. Appl, Vol. 8, No. 2, July 2016 ISSN 2074-8523 Secure Domination in Graphs S.V. Divya Rashmi 1, S. Arumugam 2, and Ibrahim Venkat 3 1 Department of Mathematics Vidyavardhaka
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 informationInduced Cycle Decomposition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 84, 4165-4169 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.5269 Induced Cycle Decomposition of Graphs Rosalio G. Artes, Jr. Department
More informationCRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES. Ahmed Bouchou and Mostafa Blidia
Opuscula Math. 36, no. 5 (2016, 563 574 http://dx.doi.org/10.7494/opmath.2016.36.5.563 Opuscula Mathematica CRITICALITY INDICES OF 2-RAINBOW DOMINATION OF PATHS AND CYCLES Ahmed Bouchou and Mostafa Blidia
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationDominating Broadcasts in Graphs. Sarada Rachelle Anne Herke
Dominating Broadcasts in Graphs by Sarada Rachelle Anne Herke Bachelor of Science, University of Victoria, 2007 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
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 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 informationAn Explicit Construction of Optimal Dominating and [1, 2] Dominating Sets in Grid
An Explicit Construction of Optimal Dominating and [ 2] Dominating Sets in Grid P. Sharifani 1, M.R. Hooshmandasl 2, M. Alambardar Meybodi 3 3 Department of Computer Science, Yazd University, Yazd, Iran.
More informationDirect Product of BF-Algebras
International Journal of Algebra, Vol. 10, 2016, no. 3, 125-132 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.614 Direct Product of BF-Algebras Randy C. Teves and Joemar C. Endam Department
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 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 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 informationContra θ-c-continuous Functions
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 1, 43-50 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.714 Contra θ-c-continuous Functions C. W. Baker
More informationOn a 3-Uniform Path-Hypergraph on 5 Vertices
Applied Mathematical Sciences, Vol. 10, 2016, no. 30, 1489-1500 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.512742 On a 3-Uniform Path-Hypergraph on 5 Vertices Paola Bonacini Department
More informationMinimal Spanning Tree From a Minimum Dominating Set
Minimal Spanning Tree From a Minimum Dominating Set M. YAMUNA VIT University School of advanced sciences Vellore, Tamilnadu INDIA myamuna@vit.ac.in K. KARTHIKA VIT University School of advanced sciences
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 informationDiophantine Equations. Elementary Methods
International Mathematical Forum, Vol. 12, 2017, no. 9, 429-438 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7223 Diophantine Equations. Elementary Methods Rafael Jakimczuk División Matemática,
More informationImprovements in Newton-Rapshon Method for Nonlinear Equations Using Modified Adomian Decomposition Method
International Journal of Mathematical Analysis Vol. 9, 2015, no. 39, 1919-1928 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.54124 Improvements in Newton-Rapshon Method for Nonlinear
More informationOn Annihilator Small Intersection Graph
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 283-289 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7931 On Annihilator Small Intersection Graph Mehdi
More informationTotal Dominator Colorings in Paths
International J.Math. Combin. Vol.2(2012), 89-95 Total Dominator Colorings in Paths A.Vijayalekshmi (S.T.Hindu College, Nagercoil, Tamil Nadu, India) E-mail: vijimath.a@gmail.com Abstract: Let G be a graph
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 informationResearch on Independence of. Random Variables
Applied Mathematical Sciences, Vol., 08, no. 3, - 7 HIKARI Ltd, www.m-hikari.com https://doi.org/0.988/ams.08.8708 Research on Independence of Random Variables Jian Wang and Qiuli Dong School of Mathematics
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 informationAnother Sixth-Order Iterative Method Free from Derivative for Solving Multiple Roots of a Nonlinear Equation
Applied Mathematical Sciences, Vol. 11, 2017, no. 43, 2121-2129 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.76208 Another Sixth-Order Iterative Method Free from Derivative for Solving
More informationRoman domination number of the Cartesian products of paths and cycles
Roman domination number of the Cartesian products of paths and cycles Polona Pavlič Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia polona.pavlic@imfm.si Janez Žerovnik
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 informationOn a Certain Representation in the Pairs of Normed Spaces
Applied Mathematical Sciences, Vol. 12, 2018, no. 3, 115-119 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.712362 On a Certain Representation in the Pairs of ormed Spaces Ahiro Hoshida
More informationOn Uniform Limit Theorem and Completion of Probabilistic Metric Space
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 10, 455-461 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4120 On Uniform Limit Theorem and Completion of Probabilistic Metric Space
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 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 informationHAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS. 1. Introduction
HAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS VALERY S. GORDON, YURY L. ORLOVICH, FRANK WERNER Abstract. A triangular grid graph is a finite induced subgraph of the infinite graph associated with the
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 informationOn Disjoint Restrained Domination in Graphs 1
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 3 (2016), pp. 2385-2394 Research India Publications http://www.ripublication.com/gjpam.htm On Disjoint Restrained Domination
More informationInternational Mathematical Forum, Vol. 9, 2014, no. 36, HIKARI Ltd,
International Mathematical Forum, Vol. 9, 2014, no. 36, 1751-1756 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.411187 Generalized Filters S. Palaniammal Department of Mathematics Thiruvalluvar
More informationReal and Integer Domination in Graphs
Real and Integer Domination in Graphs Wayne Goddard 1 Department of Computer Science, University of Natal, Durban 4041, South Africa Michael A. Henning 1 Department of Mathematics, University of Natal,
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 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 informationAn Abundancy Result for the Two Prime Power Case and Results for an Equations of Goormaghtigh
International Mathematical Forum, Vol. 8, 2013, no. 9, 427-432 HIKARI Ltd, www.m-hikari.com An Abundancy Result for the Two Prime Power Case and Results for an Equations of Goormaghtigh Richard F. Ryan
More informationOn Regular Prime Graphs of Solvable Groups
International Journal of Algebra, Vol. 10, 2016, no. 10, 491-495 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2016.6858 On Regular Prime Graphs of Solvable Groups Donnie Munyao Kasyoki Department
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 information