Computer Engineering Department, Ege University 35100, Bornova Izmir, Turkey
|
|
- Shannon Riley
- 5 years ago
- Views:
Transcription
1 Selçuk J. Appl. Math. Vol. 10. No. 1. pp , 009 Selçuk Journal of Applied Mathematics Computing the Tenacity of Some Graphs Vecdi Aytaç Computer Engineering Department, Ege University 35100, Bornova Izmir, Turkey Received: January 5, 009 Abstract. In communication networks, vulnerability indicates the resistance of a network to disruptions in communication after a breakdown of some processors or communication links. We may use graphs to model networks, as graph theoretical parameters can be used to describe the stability and reliability of communication networks. In an analysis of the vulnerability of such a graph (or communication network) to disruption, two quantities (there may be others) that are important are: (1) the number of the components in the unaffected graph, () the size of the largest connected component. In particular, it is crucial that the first of these quantities be small, while the second is large, in order for one to say that the graph has tenacity. The concept of tenacity was introduced as a measure of graph vulnerability in this sense. The tenacity of a graph is defined as + ( ) () =min : () and ( ) 1 ( ) where the ( ) is the number of components of and ( )is the number of vertices in a largest component of G. In this paper we give some bounds for tenacity and determination of the tenacity of total graphs of specific families of graphs and combinations of these graphs. Keywords: Network, Vulnerability, Graph Theory, Stability, Connectivity and Tenacity. 000 Mathematics Subject Classification: 05C99, 05C40, 68R10, 90C7, 90C35, 90B1. 107
2 1. Introduction A communication network is composed of processors and communication links. Network designers attach importance the reliability and stability of a network. If the network begins losing communication links or processors, then there is a loss in its effectiveness. This event is called as the vulnerability of communication network. The vulnerability of communication networks measures the resistance of a network to a disruption in operation after the failure of certain processors and communication links. Cable cuts, processor interruptions, software errors, hardware failures, or transmission failure at various points can interrupt service for a long period of time. But network designs require greater degrees of stability and reliability or less vulnerability in communication networks. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconfiguration of the network. The communication network often has as considerable an impact on a network s performance as the processors themselves. Performance measures for communication networks are essential to guide the designers in choosing an appropriate topology. In order to measure the performance we are interested in the following performance metrics (there may be others): (1) the number of the components of the remaining graph, () the size of the largest connected component. The communication network can be represented as an undirected and unweighted where a processor (station) is represented as a node and a communication link between processors (stations) as an edge between corresponding nodes. A graph G is denoted by =( ()()), where () is vertices of set of G and () is edges of set of G. The number of vertices and the number of edges of the graph G are denoted by () =, () = respectively. Tree, star, cycle, mesh, complete and hypercube graph are popular communication networks. A complete graph K is a fully connected (or all to all) network. In a complete graph, each vertex is directly connected to all other vertices. So each vertex has n-1 connections. A mesh graph is a cartesian product of path graphs and. Communication is allowed only between neighbouring vertices. In D mesh, all interior vertices are connected to four other vertices. A cycle is a linear array with the end nodes linked. So each vertex has degree. An -dimensional hypercube consists of vertices and 1 edges. The each vertex degree and diameter of are. An n-dimensional star graph consists of n! vertices and (( 1)!) edges. has a smaller degree and diameter than the hypercube. A tree is a connected graph that contains no subgraph isomorphic to a cycle. If we use a graph to model a network, there are many graph theoretical parameters used to describe the stability and reliability of communication networks 108
3 including connectivity, integrity, toughness, binding number and tenacity [1-4, 6-10, 1]. Definitions of some graph parameters are given below. Definition 1.1: (): Theconnectivity of a graph G is defined by () = min { } () for which is disconnected or trivial. Definition 1.: (): Thetoughness of a graph G is defined by () = min () ( ) where S is a vertex cut of G and ( ) is the number of the components of G-S. Definition 1.3: (): Theintegrity of a graph is given by () = min { + ( )} () where ( ) is the maximum number of vertices in a component of. Definition 1.4: (): Thetenacity of a graph is defined as () = + ( ) min : and ( ) () ( ) where the ( ) is the number of components of and ( ) is the number of vertices in a largest component of G. Definition 1.5: [5] For a connected graph G, we define the distance ( ) between two vertices u and v as the minimum of the lengths of the u-v paths of G. Definition 1.6: [5] A subset S of V is called an independent of G if no two vertices of S are adjacent in G. An independent set S is a maximum if G has no independent set S with. The independence number of G, (), is the number of vertices in a maximum independent set of G. Definition 1.7: [5] A subset S of V is called a covering of G if every edge of G has at least one end in S. A covering S is a minimum covering if G has no covering S with. The covering number, (), isthenumberof vertices in a minimum covering of G. 109
4 Theorem 1.1: [5, 13] For any graph G of order n, ()+() = In the next section, known results on the tenacity of specific families of graphs, on bounds for the tenacity, on relationships between tenacity and other parameters are given. In Section 3 we consider with the relations between the tenacity and the others graph theoretical parameters. After that we give our theorem relating to tenacity and the independence number. Finally, we formulize the tenacity values of total graph of some basic graphs. We find also tenacity of graphs that are obtained from corona operation of total graphs of some graphs. Throughout this work, the first integer larger than or equal to x is denoted by de, thefirst integer small than or equal to x is denoted by bc, and the absolute value of x is denoted by.. Results on Tenacity In this section, we will review some of the known results. Theorem.1: [9, 10] If G is a spanning subgraph of H, then () (). Theorem.: [9, 10] For any graph G, () ()+1,where() is the () independence number of G. Theorem.3: [9, 10] If G is not complete, then () ()+1 () Theorem.4: [9, 10] For any graph G, () ()+ 1 (). Theorem.5: [9, 10] For any nontrivial, non complete graph G with n vertices and any vertex v, ( ) () 1. Theorem.6: [7, 9,10] ( 1 if n is odd (a) For every integer, ( )= + if n is even (b) For any positive integer n, ( )= +. + (c) For any even integers n and m, ( )=. (d) For any even integer n, ( )= +1. (e) For any positive integer n, ( )=
5 3. Bound for Tenacity of a Graph In this section, we consider with the relations between the tenacity and the toughness, connectivity and integrity. Theorem 3.1: Let G be a connected graph such that () = and () =. Then ( 1) ( +1) 1 Proof: Denote the order of G by n. Then ( )+. Itiseasytosee that ( ) ( ) From the definition of () we know that + ( ). Therefore ( ) ( )+1 = +1 ( + ( )) +1 On the other hand, since 1, wehave( ). (1) + ( ) + ( ) +( ( ) 1) = ( ) +( ( ) 1) ( ( ) + ) ( ) = + ( ) ( )( +1) ( ) = ( )+ ( +1) ( ) ( )+ ( +1 ) ( ) + ( ) From the definition of () we know that (). On the ( ) other hand, it is not difficult to see that + ( ) +1 ( ). +1 ( ) Therefore () which implies that ( ) +1 ( ) +1. So, we know that ( ) and ( ) Wewritetheseresults in above inequality (1). Therefore we have the following inequality; 111
6 + ( ) +( ) +1 ( +1 ) +1 +( +1 ) ( 1) ( 1) ( +1) The proof is completed. +1 ( 1) ( +1) 1 1 Theorem 3.: Let G be a connected graph such that () =, () = and () =.Then ( +1) 1 Proof: As showing in the proof of the above Theorem 3.1, we have ( ) +1 from the definition of T(G) ( ) The proof is completed. ( +1) 1 ( +1) 1 Corollary 3.1: For any graph G, t(g) + 1 ( +1) () 1. () Proof: This result is easily seen from Theorem 3. and Theorem. 1. Theorem 3.3: Let G 1 and G be two graphs with n vertices. If ( 1 ) ( ), then ( 1 ) ( ). Proof: We have () ()+1 from Proposition. 3. In this case () if the value of () enlarges, then tenacity becomes small. For two graphs having the same number of vertices, if ( 1 ) ( ) then it is easy to see that ( 1 ) ( ). Therefore, we have ( 1 ) ( ). Theorem 3.4: ForanygraphGwithnvertices,if( ) then () = ()+1. () Proof: If ( ), in the same time the graph G does not contain as an induced subgraph. There are three cases for the proof. 11
7 Case 1. ( ) =1. Clearly, = () and ( ) =(). Hence, + ( ) ()+1 () =min =min ( ) () = ()+1 () Case. ( ) =. Clearly, = () 1 and ( ) =(). Hence, + ( ) () 1+ () =min =min ( ) () This result is the same as the result of Case1. Case 3. ( ). Clearly, = ( ) and ( ) =1. Hence, = ()+1 () + ( ) ( ) +( ) () =min =min = ( ) 1 It is easy to see that ()+1 () 4. Tenacity and Operations on Total Graphs. Hence, we obtain that () = ()+1. () In this section, firstly, we will give a definition of total graph of a graph and corona operation on graphs. After that we will give some results about the tenacity of ( ), ( ), ( 1 ), ( ) ( ) and ( ) ( ). Definition 4.1: [11] The vertices and edges of a graph are called its elements. Two elements of a graph are neighbors if they are either incident or adjacent. The total graph () of the graph =( ()()), hasvertexset () (), and two vertices of () are adjacent whenever they are neighbors in G. It is easy to see that () always contains both G and Line graph () as a induced subgraphs. Total graph is the largest graph that is formed by the adjacent relations of elements of a graph. It is important from this respect [11]. Fig.1. Formation of a total graph 113
8 Theorem 4.1: The tenacity value of ( ) is defined as, ( ( )) ( ( )) +1 Proof: If we remove r vertices from graph j ( ), then the number of the remaining connected components is at most +1. In this case the order of k the largest remaining component is ( ) 1 ( ( )) +1 ( + 1 ) min The function [ +( 1 ) (() + 1)] [() + 1] takes its minimum value at = 1. Consequently, The proof is completed. ( ( )) ( ( )) +1 ( ) ( ( )) Corollary 4.1: For the graph ( )(( )) = min +1 ( ( )). Proof: The number of vertices, the independence number» and the covering ¼ ( ( )) number of ( ) are ( ( )) = 1, ( ( )) = and 3 ( ( )= 1 (( )) respectively. There are three cases. Case1. ( ( ) ) =1 Clearly, = ( ( )) and ( ( ) ) =( ( )). Hence, ( ( )) = min + ( ( ) ) =min ( ( ) ) ( )+1 ( ( )) = ( ( ))) ( ( )) Case. ( ( ) ) = Clearly, = 1 and ( ( ) ) = ( ( )) = min l m. Hence, ( ) + ( ( ) ) +1 =min ( ( ) ) = +1 Case 3. 3 ( ( ) ) 1 (3 + ) = 6 Clearly, ( ( )) 1 and ( ( ) ). Hence, 114
9 + ( ( ) ) + ( ( )) 9 ( ( )) = min min ( ( ) ) + ( ( )) 9 We claim that this result is greater than the above results. Firstly, we show that this result is greater than the Case 1. ( ( ))) ( ( ))? + ( ( )) 9 + ( ( )) 9 = ( ( )) + ( 9) It is easy to see that ( ( )) + ( 9) ( ( ))) ( ( )) Now we show that this result is greater than the Case. for 9. +1? + ( ( )) 9 = 3 (( ( )) + 9) 3 (( ( )) + 9) ( +1)? 0 (3 ( ( ) 13) 4 = ( + ( ( ) 13) 4 For 9 and ( ( ), + ( ( ) Thus,( + ( ( ) 13) 9 and ( + ( ( ) 13) 4 0. Hence, the proof of the claim is completed. Thus tenacity of ( ) is the minimum value of the obtained results from the above cases. The proof is completed. 3 Corollary 4.: For the graph ( ), ( ( )) ( ( )) 6+( ( )). Proof: This corollary gives the upper and below bounds for the tenacity of ( ) to us. There are two cases. Case 1. ( ( ) ) 1 Clearly, and ( ( ) ) ( ( )). Hence, + ( ( ) ) ( ( )) = min ( ( ) ) 3 ( ( )) ( ( )) ½ min 3 ( ( )) ¾ = 3 ( ( )) Case. ThiscaseisthesameasCase 3 in the proof of the Corollary Hence, it is easy to see the right hand of the inequality. 115
10 The proof is completed. Theorem 4.: The tenacity value of ( ) is defined as, ( ( )) 4 1 ( ( )) Proof: If we remove r vertices from graph j ( ), then the number of the remaining connected components is at most. In this case the order of the largest re- k ( maining component is ( ) + ).So,(( )) min The function [ +( ) ()] () takes its mimimum value at =4. Consequently, The proof is completed. ( ( )) 4 1 ( ( )) Corollary 4.3: For the graph ( ), ( ( )) + 1 ( ( )) = min ( ( )) ( +) if is even +3 otherwise Proof: The proof of Corollary 4.3 is done similarly as in the proof of Corollary Corollary 4.4: For the graph ( ), ( ( )) ( ( )) 7+( ( )). Proof: The proof of Corollary 4.4 is done similarly as in the proof of Corollary 4.. Theorem 4.3: Let ( 1 ) be the total graph of 1. ( ( 1 )) = +. Proof: The number of vertices, the independence number and the covering number of ( 1 ) are ( ( 1 )) = +1, ( ( 1 )) = and ( ( 1 )) = +1 respectively. Obtained new n vertices from the definition of total graph are adjacent the other 1 vertices. So, ( 1 ) contains a complete graph with n vertices. If ( ( 1 ) ) =1,then = +1and ( ( 1 ) ) = (See Fig. ). 116
11 Fig.. ( 1 ) Graph If v vertex and n vertices which are v 1,v,..., v in Fig. are removed from ( 1 ), then we have n components which have only one vertex. In this case tenacity of ( 1 ) is minimal. Thus the proof is completed. Definition 4.: [5, 11] The corona 1 was defined by Frucht and Harary as the graph G obtained by taking one copy of G 1 of order n 1 and n 1 copies of G, and then joining the i th node of G 1 toeverynodeinthei thcopyofg. Theorem 4.4: Let ( ) and ( ) be the total graphs of P and P respectively. For ( ) ( ), ( ( ) ( )) = ( ( )) + 4 ( ( ))» ¼ 1 where ( ( )) = 1. 3 Proof: There are three cases. Case 1. = ( ( )). Clearly, when we remove the vertices of the covering set of the ( ) from ( ) ( ), obtained components are K 4 or ( )= 3.So,(( ) ( ) ) = 4 and ( ( ) ( ) ) = (( ( )). Hence, ( ( ( ) ( )) + 4 ( )) = min = ( ( )) + 4 ( ( )) ( ( )) Case. ( ( )) + 1. Clearly, when we remove more than the vertices of the covering set of the ( ) from ( ) ( ), obtained components are ( )= 3.So,( ( ) ( ) ) =3and ( ( ) ( ) ) = (( ( )). Hence, ( ( ) ( )) min ( ( )) + 4 ( ( )) ( ( )) + 4 ( ( )) Thus the Case 1 is the minimum in respect of obtained this value. 117
12 Case 3. ( ( )). In this Case, the number of removed vertices is reduced but the number of vertices in the largest component is increased and the number of the components is decreased. As to Case 1, numerator is increased but denominator is decreased, so the obtained value is larger than that of Case 1. Corollary 4.5: Let ( ) and ( ) be the total graphs of P and P respectively. For ( ) ( ), ( ( ) ( )) ( ( )) Proof. There are two cases. Case1. ( ( )) = ( ( )) + 1. (( ( )) We have from Corollary 4.1, ( ( )) = ( ( )) + 1 and from Theorem 4.4 (( ( )) ( ( ) ( )) = ( ( )) + 4. Let us show that +4 ( ( )) + +1,where = ( ( )) and = ( ( )). + 3 ( + ) For ( +1)( + ) ( +4) ( + ) ( + ) ( + ) ( ) ( + )? 0? 0? 0? 0 Because of, Case. ( ( )) = +1. ( ) 0. So, the claim is true. ( + ) From Corollary 4. 1, ( ( )) = +1 and from Theorem 4. 4 ( ( ) ( )) = ( ( )) + 4.Letusshowthat +4 ( +1),where(( )) = ( ( )) 1 and 1= ( +1) +4? 0 ( +1) +4 = + + ( 4) 118 = + + ( 4)
13 Since + + ( 4) 0, the claim is true. Consequently, the proof is completed. Theorem 4.5: Let T(C ) and T(P ) be the total graphs of C and P respectively. For ( ) ( ), ( ( ) ( )) = ( ( )) + 4 ( ( )) ¹ º ( ( )) where ( ( )) = 3 Proof: The proof of Theorem 4. 5 is done similarly as in the proof of Theorem Corollary 4.6: Let T(C ) and T(P ) be the total graphs of C and P respectively. For ( ) ( ), ( ( ) ( )) ( ( )) Proof: It is done similarly as in the proof of Corollary Conclusion If a system such as a communication network is modeled by a graph G, there are many graph theoretical parameters used to describe the stability and reliability of communication networks including connectivity, integrity, toughness, binding number and tenacity. Two ways of measuring the stability of a network is through the ease with which one can disrupt the network, and the cost of a disruption. Connectivity has the least cost as far as disrupting the network, but it does not take into account what remains after disruption. One can say that the disruption is less harmful if the disconnected network contains more components andmuchlessharmfuliftheaffected components are small. One can associate the cost with the number of the vertices destroyed to get small components and the reward with the number of the components remaining after destruction. The tenacity measure is compromise between the cost and the reward by minimizing the cost: reward ratio. Thus, a network with a large tenacity performs better under external attack. The results of this paper suggest that tenacity is a more suitable measure of stability in that it has the ability to distinguish between graphs that intuitively should have different measures of stability. References 1. Bagga K.S. - Beineke L.W. Goddard W.D. - Lipman M.J. and Pippert R.E., A Survey of Integrity, Discrete Applied Math. 37/38, 13-8,199.. Bagga K.S. - Beineke L.W. and Pippert R.E, Edge Integrity: A Survey, Discrete Math., 14, 3-1(1994). 3. Barefoot C.A, Entringer R., and Swart H.C., Vulnerability in Graphs-A Comparative Survey. J.Comb.Math.Comb.Comput. 1, 13-,
14 4. Barefoot C.A, Entringer R., and Swart H.C., Integrity of Trees and Powers of Cycles, Congressus Numeratum 58, , Chartrand G. - Lesniak L,.Graphs and Digraphs, California Wadsworth & Brooks, Chvatal V., Tough Graphs and Hamiltonian Circuits, Discrete Math.5, 15-18, Choudum S. A. and Priya N., Tenacity of Complete Graph Products and Grids, Networks 34, , Cozzens M., Stability Measures and Data Fusion Networks, Graph Theory Notes of New York XXVI, pp.8-14, Cozzens M. - Moazzami D.and Stueckle S., the Tenacity of A Graph, Graph Theory, Combinatorics, Algorithms and Applications. Vol Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June15, 199. New York, NY.Wiley, pp Cozzens M. - Moazzami D. and Stueckle S., the Tenacity of Harary Graphs, J.Comb. Math. Comb. Comput. 16, 33-56, Harary F., Graph Theory, Addison-Wesley Pub. California, Dündar P., - Aytac A., Integrity of Total Graphs via Some Parameters, Mathematical Notes Vol.76, N5 (November), p , West D.B., Introduction to Graph Theory, Prentice Hall, NJ,
DOMINATION 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 informationMeasures of Vulnerability The Integrity Family
Measures of Vulnerability The Integrity Family Wayne Goddard University of Pennsylvania 1 Abstract In this paper a schema of graphical parameters is proposed. Based on the parameter integrity introduced
More informationTowards a measure of vulnerability, tenacity of a Graph
Journal of Algorithms and Computation journal homepage: http://jacutacir Towards a measure of vulnerability, tenacity of a Graph Dara Moazzami 1 1 University of Tehran, College of Engineering, Department
More informationThe Binding Number of Trees and K(1,3)-free Graphs
The Binding Number of Trees and K(1,3)-free Graphs Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract The binding number of a graph G is defined
More informationIntegrity in Graphs: Bounds and Basics
Integrity in Graphs: Bounds and Basics Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 USA and Henda C. Swart Department of Mathematics, University of
More informationThe Edge-Integrity of Cartesian Products
The Edge-Integrity of Cartesian Products Lowell W. Beineke, Indiana-Purdue University at Fort Wayne Wayne Goddard, University of Pennsylvania Marc J. Lipman, Office of Naval Research Abstract The edge-integrity
More informationThe Toughness of Cubic Graphs
The Toughness of Cubic Graphs Wayne Goddard Department of Mathematics University of Pennsylvania Philadelphia PA 19104 USA wgoddard@math.upenn.edu Abstract The toughness of a graph G is the minimum of
More informationTHE DECK RATIO AND SELF-REPAIRING GRAPHS
THE DECK RATIO AND SELF-REPAIRING GRAPHS YULIA BUGAEV AND FELIX GOLDBERG Abstract. In this paper we define, for a graph invariant ψ, the ψ(g) deck ratio of ψ by D ψ (G) = P ψ(g v). We give generic upper
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Varaporn Saenpholphat; Ping Zhang Connected resolvability of graphs Czechoslovak Mathematical Journal, Vol. 53 (2003), No. 4, 827 840 Persistent URL: http://dml.cz/dmlcz/127843
More informationToughness, connectivity and the spectrum of regular graphs
Outline Toughness, connectivity and the spectrum of regular graphs Xiaofeng Gu (University of West Georgia) Joint work with S.M. Cioabă (University of Delaware) AEGT, August 7, 2017 Outline Outline 1 Toughness
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationMAXIMAL VERTEX-CONNECTIVITY OF S n,k
MAXIMAL VERTEX-CONNECTIVITY OF S n,k EDDIE CHENG, WILLIAM A. LINDSEY, AND DANIEL E. STEFFY Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain
More informationAnalogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph
Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph M. Lemańska a, J. A. Rodríguez-Velázquez b, Rolando Trujillo-Rasua c, a Department of Technical
More informationMore on Tree Cover of Graphs
International Journal of Mathematical Analysis Vol. 9, 2015, no. 12, 575-579 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.410320 More on Tree Cover of Graphs Rosalio G. Artes, Jr.
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
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 informationDistance in Graphs - Taking the Long View
AKCE J Graphs Combin, 1, No 1 (2004) 1-13 istance in Graphs - Taking the Long View Gary Chartrand 1 and Ping Zhang 2 epartment of Mathematics, Western Michigan University, Kalamazoo, MI 49008, USA 1 e-mail:
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 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 informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationFundamental Dominations in Graphs
Fundamental Dominations in Graphs arxiv:0808.4022v1 [math.co] 29 Aug 2008 Arash Behzad University of California, LosAngeles abehzad@ee.ucla.edu Mehdi Behzad Shahid Beheshti University, Iran mbehzad@sharif.edu
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
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 informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn P 2 P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph
On P P n -Supermagic Labeling of Edge Corona Product of Cycle and Path Graph Riza Yulianto and Titin Sri Martini Mathematics Department of Mathematics and Natural Sciences Faculty, Universitas Sebelas
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
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 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 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 informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
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 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 informationarxiv: v1 [math.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
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 informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
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 informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More information(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)
Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University
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 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 informationNetwork Augmentation and the Multigraph Conjecture
Network Augmentation and the Multigraph Conjecture Nathan Kahl Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 e-mail: nkahl@stevens-tech.edu Abstract Let Γ(n, m)
More informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More informationINTERPOLATION THEOREMS FOR A FAMILY OF SPANNING SUBGRAPHS. SANMING ZHOU, Hong Kong
Czechoslovak Mathematical Journal, 48 (123) (1998), Praha INTERPOLATION THEOREMS FOR A FAMILY OF SPANNING SUBGRAPHS SANMING ZHOU, Hong Kong (Received March 20, 1995) Abstract. Let G be a graph with order
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
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 informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationIndependence in Function Graphs
Independence in Function Graphs Ralucca Gera 1, Craig E. Larson 2, Ryan Pepper 3, and Craig Rasmussen 1 1 Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA 93943; rgera@nps.edu,
More informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
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 informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationRegular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Peter Hamburger Department of Mathematical
More informationRECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES
Discussiones Mathematicae Graph Theory 20 (2000 ) 39 56 RECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES Blaž Zmazek Department of Mathematics, PEF, University of Maribor Koroška 160, si-2000 Maribor,
More informationMinimal Congestion Trees
Minimal Congestion Trees M. I. Ostrovskii Department of Mathematics The Catholic University of America Washington, D.C. 20064, USA e-mail: ostrovskii@cua.edu September 13, 2004 Abstract. Let G be a graph
More informationDistance Connectivity in Graphs and Digraphs
Distance Connectivity in Graphs and Digraphs M.C. Balbuena, A. Carmona Departament de Matemàtica Aplicada III M.A. Fiol Departament de Matemàtica Aplicada i Telemàtica Universitat Politècnica de Catalunya,
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
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 informationIdentifying Graph Automorphisms Using Determining Sets
Identifying Graph Automorphisms Using Determining Sets Debra L. Boutin Department of Mathematics Hamilton College, Clinton, NY 13323 dboutin@hamilton.edu Submitted: May 31, 2006; Accepted: Aug 22, 2006;
More informationarxiv: v3 [cs.dm] 18 Oct 2017
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes arxiv:1707.02473v3 [cs.dm] 18 Oct 2017 Fábio Protti and Uéverton dos Santos Souza Institute of Computing - Universidade
More informationAalborg Universitet. All P3-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl. Publication date: 2008
Aalborg Universitet All P-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl Publication date: 2008 Document Version Publisher's PD, also known as Version of record Link to publication from
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More informationOn connected resolvability of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 28 (2003), Pages 25 37 On connected resolvability of graphs Varaporn Saenpholphat and Ping Zhang Department of Mathematics Western Michigan University Kalamazoo,
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationarxiv: v1 [cs.dm] 24 Jan 2008
5-cycles and the Petersen graph arxiv:0801.3714v1 [cs.dm] 24 Jan 2008 M. DeVos, V. V. Mkrtchyan, S. S. Petrosyan, Department of Mathematics, Simon Fraser University, Canada Department of Informatics and
More informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationH-E-Super magic decomposition of graphs
Electronic Journal of Graph Theory and Applications () (014), 115 18 H-E-Super magic decomposition of graphs S. P. Subbiah a, J. Pandimadevi b a Department of Mathematics Mannar Thirumalai Naicker College
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationA characterisation of eccentric sequences of maximal outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58(3) (2014), Pages 376 391 A characterisation of eccentric sequences of maximal outerplanar graphs P. Dankelmann Department of Mathematics University of Johannesburg
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationThe Nordhaus-Gaddum problem for the k-defective chromatic number of a P 4 -free graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 3 13 The Nordhaus-Gaddum problem for the k-defective chromatic number of a P 4 -free graph Nirmala Achuthan N. R. Achuthan Department of Mathematics
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 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 informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationOn Hamiltonian cycles and Hamiltonian paths
Information Processing Letters 94 (2005) 37 41 www.elsevier.com/locate/ipl On Hamiltonian cycles and Hamiltonian paths M. Sohel Rahman a,, M. Kaykobad a,b a Department of Computer Science and Engineering,
More informationTough graphs and hamiltonian circuits
Discrete Mathematics 306 (2006) 910 917 www.elsevier.com/locate/disc Tough graphs and hamiltonian circuits V. Chvátal Centre de Recherches Mathématiques, Université de Montréal, Montréal, Canada Abstract
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 informationDistance between two k-sets and Path-Systems Extendibility
Distance between two k-sets and Path-Systems Extendibility December 2, 2003 Ronald J. Gould (Emory University), Thor C. Whalen (Metron, Inc.) Abstract Given a simple graph G on n vertices, let σ 2 (G)
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
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 informationSATURATION SPECTRUM OF PATHS AND STARS
1 Discussiones Mathematicae Graph Theory xx (xxxx 1 9 3 SATURATION SPECTRUM OF PATHS AND STARS 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 Jill Faudree Department of Mathematics and Statistics University of
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationBounds on the Traveling Salesman Problem
Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,
More informationDistance-related Properties of Corona of Certain Graphs
Distance-related Properties of Corona of Certain Graphs S. Sriram, Atulya K. Nagar, and K.G. Subramanian Department of Mathematics, VELS University, Pallavaram, Chennai 600 042 India e-mail:sriram.discrete@gmail.com
More informationUniquely identifying the edges of a graph: the edge metric dimension
Uniquely identifying the edges of a graph: the edge metric dimension Aleksander Kelenc (1), Niko Tratnik (1) and Ismael G. Yero (2) (1) Faculty of Natural Sciences and Mathematics University of Maribor,
More informationEdge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs
Edge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs Sebastian M. Cioabă and Wiseley Wong MSC: 05C50, 15A18, 05C4, 15A4 March 1, 01 Abstract Partially answering a question of Paul Seymour, we
More informationThe Simultaneous Local Metric Dimension of Graph Families
Article The Simultaneous Local Metric Dimension of Graph Families Gabriel A. Barragán-Ramírez 1, Alejandro Estrada-Moreno 1, Yunior Ramírez-Cruz 2, * and Juan A. Rodríguez-Velázquez 1 1 Departament d Enginyeria
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
More informationGraph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University
Graph Theorizing Peg Solitaire D. Paul Hoilman East Tennessee State University December 7, 00 Contents INTRODUCTION SIMPLE SOLVING CONCEPTS 5 IMPROVED SOLVING 7 4 RELATED GAMES 5 5 PROGENATION OF SOLVABLE
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
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 informationOn the Local Colorings of Graphs
On the Local Colorings of Graphs Behnaz Omoomi and Ali Pourmiri Department of Mathematical Sciences Isfahan University of Technology 84154, Isfahan, Iran Abstract A local coloring of a graph G is a function
More information