Research Article The Average Lower Connectivity of Graphs

Similar documents
Research Article The Probability That a Measurement Falls within a Range of n Standard Deviations from an Estimate of the Mean

A New Constructive Proof of Graham's Theorem and More New Classes of Functionally Complete Functions

A New Approach to Obtain an Optimal Solution for the Assignment Problem

LET G = (V (G), E(G)) be a graph with vertex

Bayes Estimator for Coefficient of Variation and Inverse Coefficient of Variation for the Normal Distribution

Average Distance and Vertex-Connectivity

1 Random Variables and Key Statistics

Statistics for Economics & Business

Estimating Proportions with Confidence

Neighboring Optimal Solution for Fuzzy Travelling Salesman Problem

Problem Set 1a - Oligopoly

Solution to Tutorial 6

Subject CT1 Financial Mathematics Core Technical Syllabus

Estimation of Population Variance Utilizing Auxiliary Information

Monopoly vs. Competition in Light of Extraction Norms. Abstract

Unbiased estimators Estimators

Rafa l Kulik and Marc Raimondo. University of Ottawa and University of Sydney. Supplementary material

Combining imperfect data, and an introduction to data assimilation Ross Bannister, NCEO, September 2010

Random Sequences Using the Divisor Pairs Function

Lecture 9: The law of large numbers and central limit theorem

The Limit of a Sequence (Brief Summary) 1

Inferential Statistics and Probability a Holistic Approach. Inference Process. Inference Process. Chapter 8 Slides. Maurice Geraghty,

An efficient and fair solution for communication graph games 1

Anomaly Correction by Optimal Trading Frequency

5. Best Unbiased Estimators

x satisfying all regularity conditions. Then

Maximum Empirical Likelihood Estimation (MELE)

The material in this chapter is motivated by Experiment 9.

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

SUPPLEMENTAL MATERIAL

Parametric Density Estimation: Maximum Likelihood Estimation

Stochastic Processes and their Applications in Financial Pricing

Chapter 5: Sequences and Series

The Time Value of Money in Financial Management

Online appendices from Counterparty Risk and Credit Value Adjustment a continuing challenge for global financial markets by Jon Gregory

Notes on Expected Revenue from Auctions

ON DIFFERENTIATION AND HARMONIC NUMBERS

BASIC STATISTICS ECOE 1323

NORMALIZATION OF BEURLING GENERALIZED PRIMES WITH RIEMANN HYPOTHESIS

. (The calculated sample mean is symbolized by x.)

Productivity depending risk minimization of production activities

Chapter 8. Confidence Interval Estimation. Copyright 2015, 2012, 2009 Pearson Education, Inc. Chapter 8, Slide 1


Topic-7. Large Sample Estimation

Journal of Statistical Software

Control Charts for Mean under Shrinkage Technique

point estimator a random variable (like P or X) whose values are used to estimate a population parameter

TENS Unit Prior Authorization Process

Mark to Market Procedures (06, 2017)

Non-Inferiority Logrank Tests

Supersedes: 1.3 This procedure assumes that the minimal conditions for applying ISO 3301:1975 have been met, but additional criteria can be used.

B = A x z

The Communication Complexity of Coalition Formation among Autonomous Agents

An Empirical Study of the Behaviour of the Sample Kurtosis in Samples from Symmetric Stable Distributions

CAPITALIZATION (PREVENTION) OF PAYMENT PAYMENTS WITH PERIOD OF DIFFERENT MATURITY FROM THE PERIOD OF PAYMENTS

14.30 Introduction to Statistical Methods in Economics Spring 2009

Department of Mathematics, S.R.K.R. Engineering College, Bhimavaram, A.P., India 2

Forecasting bad debt losses using clustering algorithms and Markov chains

Folia Oeconomica Stetinensia DOI: /foli NOTE TO

Faculdade de Economia da Universidade de Coimbra

Decision Science Letters

CHANGE POINT TREND ANALYSIS OF GNI PER CAPITA IN SELECTED EUROPEAN COUNTRIES AND ISRAEL

EXERCISE - BINOMIAL THEOREM

Hopscotch and Explicit difference method for solving Black-Scholes PDE

NOTES ON ESTIMATION AND CONFIDENCE INTERVALS. 1. Estimation

A point estimate is the value of a statistic that estimates the value of a parameter.

Solutions to Problem Sheet 1

Sequences and Series

International Journal of Management (IJM), ISSN (Print), ISSN (Online) Volume 1, Number 2, July - Aug (2010), IAEME

This paper provides a new portfolio selection rule. The objective is to minimize the

ECON 5350 Class Notes Maximum Likelihood Estimation

Positivity Preserving Schemes for Black-Scholes Equation

(Hypothetical) Negative Probabilities Can Speed Up Uncertainty Propagation Algorithms

Policy Improvement for Repeated Zero-Sum Games with Asymmetric Information

Math 312, Intro. to Real Analysis: Homework #4 Solutions

An Improved Estimator of Population Variance using known Coefficient of Variation

The Valuation of the Catastrophe Equity Puts with Jump Risks

FINM6900 Finance Theory How Is Asymmetric Information Reflected in Asset Prices?

AUTOMATIC GENERATION OF FUZZY PAYOFF MATRIX IN GAME THEORY

ST 305: Exam 2 Fall 2014

Marking Estimation of Petri Nets based on Partial Observation

Research Article Statistical Behavior of a Financial Model by Lattice Fractal Sierpinski Carpet Percolation

Chapter 10 - Lecture 2 The independent two sample t-test and. confidence interval

A Bayesian perspective on estimating mean, variance, and standard-deviation from data

A random variable is a variable whose value is a numerical outcome of a random phenomenon.

CHAPTER 2 PRICING OF BONDS

Lecture 5: Sampling Distribution

Subject CT5 Contingencies Core Technical. Syllabus. for the 2011 Examinations. The Faculty of Actuaries and Institute of Actuaries.

STRAND: FINANCE. Unit 3 Loans and Mortgages TEXT. Contents. Section. 3.1 Annual Percentage Rate (APR) 3.2 APR for Repayment of Loans

Section Mathematical Induction and Section Strong Induction and Well-Ordering

Estimating Forward Looking Distribution with the Ross Recovery Theorem

On the Composition of 2-Prover Commitments and Multi-Round Relativistic Commitments. CWI Amsterdam

Standard BAL a Real Power Balancing Control Performance

Institute of Actuaries of India Subject CT5 General Insurance, Life and Health Contingencies

Sampling Distributions and Estimation

Structuring the Selling Employee/ Shareholder Transition Period Payments after a Closely Held Company Acquisition

Lecture 5 Point Es/mator and Sampling Distribu/on

On the Set-Union Budget Scenario Problem

ISBN Copyright 2015 The Continental Press, Inc.

Discriminating Between The Log-normal and Gamma Distributions

Transcription:

Applied Mathematics, Article ID 807834, 4 pages http://dx.doi.org/10.1155/2014/807834 Research Article The Average Lower Coectivity of Graphs Ersi Asla Turgutlu Vocatioal Traiig School, Celal Bayar Uiversity, Turgutlu, Maisa 45400, Turkey Correspodece should be addressed to Ersi Asla; ersi.asla@cbu.edu.tr Received 14 August 2013; Revised 8 Jauary 2014; Accepted 9 Jauary 2014; Published 12 February 2014 Academic Editor: Bo-Qig Dog Copyright 2014 Ersi Asla. This is a ope access article distributed uder the Creative Commos Attributio Licese, which permits urestricted use, distributio, ad reproductio i ay medium, provided the origial work is properly cited. For a vertex V of a graph G, thelower coectivity, deotedbys V (G), is the smallest umber of vertices that cotais V ad those vertices whose deletio from G produces a discoected or a trivial graph. The average lower coectivity deoted by κ av (G) is the value ( V V(G) s V (G))/ V(G). It is show that this parameter ca be used to measure the vulerability of etworks. This paper cotais results o bouds for the average lower coectivity ad obtais the average lower coectivity of some graphs. 1. Itroductio I a commuicatio etwork, the vulerability parameters measure the resistace of the etwork to disruptio of operatio after the failure of certai statios or commuicatio liks. The best kow ad most useful measures of how well a graph is coected is the coectivity, defied to be the miimum umber of vertices i a set whose deletio results i a discoected or trivial graph. As the coectivity is the worst-case measure, it does ot always reflect what happes throughout the graph. Recet iterest i the vulerability ad reliability of etworks (commuicatio, computer, ad trasportatio) has give rise to a host of other measures, some of which are more global i ature; see, for example, [1, 2]. Let G be a fiite simple graph with vertex set V(G) ad edge set E(G). IthegraphG, deotes the umber of vertices. The miimum degree of a graph G is deoted by δ(g). A subset S V(G) of vertices is a domiatig set if every vertex i V(G) S is adjacet to at least oe vertex of S. The domiatio umber γ(g) is the miimum cardiality of a domiatig set. A subset S of V(G) is called a idepedet set of G if o two vertices of S are adjacet to G. A idepedet set S is maximum if G has o idepedet set S with S > S. The idepedece umber of G, α(g),is the umber of vertices i a maximum idepedet set of G. Heig [3] itroduced the cocept of average idepedece ad average domiatio. For a vertex V of a graph G, thelower idepedece umber, deoted by i V (G), isthe miimum cardiality of a maximal idepedet set of G that cotais V, ad the lower domiatio umber, deoted by γ V (G), is the miimum cardiality of a domiatig set of G that cotaisv.the average lower idepedece umber of G, deoted by i av (G),isthevalue( V V(G) i V (G))/ V(G) ad the average lower domiatio umber of G, deoted by γ av (G),is the value ( V V(G) γ V (G))/ V(G). Siceγ V (G) i V (G) holds for every vertex V, wehaveγ av (G) i av (G) for ay graph G. Also, it is clear that i(g) = mi{i V (G) V V(G)} ad γ(g) = mi{γ V (G) V V(G)} so γ(g) γ av (G) ad i(g) i av (G). The (u, V)-coectivity of G, deoted by κ G (u, V), is defied to be the maximum value of k for which u ad V are k-coected. It is a well-kow fact that the coectivity κ(g) equals mi{κ G (u, V)u, V V(G)}. I 2002, Beieke et al. [4]itroducedaparametertogivea more refied measure of the global amout of coectivity. If the order of G is, the the average coectivity of G, deoted by κ(g),isdefiedtobeκ(g) = ( u,v κ G (u, V))/ ( 2 ). The expressio u,v κ G (u, V) is sometimes referred to as the total coectivity of G.Clearly,for ay graph G, κ(g) κ(g). Therearealotofresearchesothecoectivityofagraph [5]. May works provide sufficiet coditios for a graph to be maximally coected [6 8]. The average coectivity has bee extesively studied [4, 9]. 2. The Average Lower Coectivity of a Graph We itroduce a ew vulerability parameter, the average lower coectivity. For a vertex V of a graph G, thelower

2 Applied Mathematics a c d O the other had, the average lower coectivity of G 1 ad G 2 is differet: b Figure 1:3-cycle G: with oe additioal vertex ad edge. κ av (G 1 ) = 1, 8, (2) κ av (G 2 ) = 1, 6. Thus, the average lower coectivity is a better parameter tha the coectivity ad average coectivity to distiguish these two graphs. The average parameters have bee foud to be more useful i some circumstaces tha the correspodig measures based o worst-case situatios. G 1 (a) G 2 (b) Theorem 2. Let G be a coected graph. The, κ av (G) <κ(g) +2. (3) Proof. For every vertex of G, s V (G) κ(g)+2.foratleastoe vertex V, s V (G) = κ(g).hece,theiequalityisstrict.the, κ av (G) <κ(g) +2. (4) Figure 2: The graphs G 1 ad G 2. Theorem 3. Let G be a coected graph. The, κ av (G) κ av (G+e). (5) coectivity, deoted by s V (G), isthesmallestumberof vertices that cotais V ad those vertices whose deletio from G produces a discoected or a trivial graph. We observe that (i) 1 s V (G) 1; (ii) s V (G) = 1 if ad oly if V is a cut vertex; (iii) s V (G) = 1 if ad oly if G V is complete. The average lower coectivity deoted by κ av (G) is the value ( V V(G) s V (G))/,where will deote the umber of vertices i graph G ad V V(G) s V (G) will deote the sum over all vertices of G.ForaygraphG, κ(g) = mi{s V (G) V V(G)} so κ av (G) κ(g).wealsoobservethat (i) κ av (G) 1; (ii) κ av (G) = 1 if ad oly if G is complete. Example 1. Let the graph G be 3-cycle with oe additioal vertex ad edge, as show i Figure 1. Itiseasytoseethat s a (G) = 2, s b (G) = 2, s c (G) = 1, ads d (G) = 3 ad we have κ av (G) = (2 + 2 + 1 + 3)/4 = 2. Let G 1 ad G 2 be graphs. Now oe ca ask the followig questio: is the average lower coectivity a suitable parameter? I other words, does the average lower coectivity distiguish betwee G 1 ad G 2? Proof. It is easy to see that s V (G) s V (G + e). Therefore, V V(G) s V (G) V V(G) s V (G+e). (6) So, we have κ av (G) κ av (G+e). (7) Theorem 4. Let G be a k-coected ad k-regular graph. The, κ av (G) =k. (8) Proof. The cardiality of s V (G)-sets is always the same for every vertex of ay graph G ad equals k.the,wehave κ av (G) = V V(G) s V (G) = k =k. (9) This meas that the proof is completed. It is obvious that we ca give the followig equality for the average lower coectivity of the cycle C. (i) The average lower coectivity of the cycle C is 2. Theorem 5. Let G be a coected graph. The, κ av (G) δ(g) +2. (10) Proof. For every vertex of G, s V (G) δ(g) + 2.Thus, For example, cosider the graphs i Figure 2. Itcabeeasilyseethatthecoectivityadaverage coectivity of these graphs are equal: κ (G 1 ) =κ(g 2 ) = κ(g 1 ) = κ(g 2 ) =1. (1) κ av (G) = V V(G) s V (G) κ av (G) δ(g) +2. (δ (G) +2), (11)

Applied Mathematics 3 3. Average Lower Coectivity of Several Specific Graphs I this sectio, we determie the average lower coectivity of several special graphs. Theorem 6. Let T be a tree with order. IfT has k vertices with degree 1, the κ av (T) = +k. (12) Proof. Assume that T has k vertices with degree 1 ad k vertices with degree at least 2. Let vertices set of T be V(T) = V(G 1 ) V(G 2 ) where i V(G 1 ) the set cotais k vertices with degree 1; i V(G 2 ) the set cotais kvertices with degree at least 2. If V V(G 1 ),thes V (G 1 )=2.Wehavetorepeat this process for k vertices with degree 1. If V V(G 2 ),the s V (G 2 )=1.Wehavetorepeatthisprocessfor kvertices with degree at least 2. Thus, we have κ av (T) = V V(T) s V (T) V (T) = k 2+( k) 1 Corollary 7. The average lower coectivity of (a) the path P is ( + 2)/; (b) the star K 1, 1 is (2 1)/; (c) the comet C t,r is (2r+t+1)/(t+r). = +k. (13) Theorem 8. Let K r,s be a complete bipartite graph. The κ av (K r,s )= { s 2 +sr+r, if s < r; { r+s { r, if r = s. (14) Proof. Let the partite sets of K r,s be R ad S with R = r ad S = s.wedistiguishtwocases. Case 1. If r=s,thebytheorem 4 we have κ av (K r,s )=r. Case 2 (r < s). Forx R, a miimum discoectig set of G that cotais x must be S {x},sos x (G) = s + 1. Othe other had, for y S, a miimum discoectig set of G that cotais y must be R,sos y (G) = r. Elemetary computatio yields the result. Defiitio 9. The wheel graph with 1spokes, W,isthe graph that cosists of a ( 1)-cycle ad oe additioal vertex, say u, that is adjacet to all the vertices of the cycle. I Figure 3,wedisplayW 7. Theorem 10. Let W be a wheel graph. The, κ av (W ) =3. (15) u Figure 3: The wheel graph W 7. u Figure 4: The gear graph G 6 Proof. The wheel graph W has vertices. The cardiality of s V (G)-setsisalwaysthesameforeveryvertexofayW ad equals 3. The, we have κ av (W )= V V(W ) s V (W ) This meas that the proof is completed. = 3 =3. (16) Defiitio 11. Thegeargraphisawheelgraphwithavertex added betwee each pair adjacet to graph vertices of the outer cycle. The gear graph G r has 2r+1 vertices ad 3r edges. I Figure 4 we display G 6. Theorem 12. Let G r be a gear graph. The, κ av (G r )= 5r + 3 2r + 1. (17) Proof. Let vertices set of G r be V(G r )=(H 1 ) V(H 2 ) V(H 3 ) where i V(H 1 ) the set cotais 1 vertex with degree, V(H 2 ) the set cotais vertices with degree 2, ad V(H 3 ) the set cotais vertices with degree 3.If V V(H 3 ),thes V (G) = 3. If V V(H 3 ),thes V (G 3 )=2. Therefore, κ av (G r )= V V(G r ) s V (G r ) 2r + 1 = (r+1) 3+2 r 2r + 1 = 5r + 3 2r + 1. Now we give the defiitio of Cartesia product. (18) Defiitio 13. The Cartesia product G 1 G 2 of graphs G 1 ad G 2 has V(G 1 ) V(G 2 ) as its vertex set ad (u 1,u 2 ) is adjacet to (V 1, V 2 )ifeitheru 1 = V 1 ad u 2 is adjacet to V 2 or u 2 = V 2 ad u 1 is adjacet to V 1. Coectivity of graph products has already bee studied by differet authors. I [10] itisprovedthatκ(g 1 G 2 ) κ(g 1 )+κ(g 2 ).

4 Applied Mathematics Theorem 14. Let G 1 ad G 2 be two coected graphs; the κ av (G 1 G 2 ) κ(g 1 G 2 ). (19) Proof. We kow κ av (G) κ(g). Therefore, we get κ av (G 1 G 2 ) κ(g 1 G 2 ). (20) Propositio 15. For positive iteger m 3, (i) κ av (K 2 P m )=2; (ii) κ av (K 2 C m )=3. [7] J. Fàbrega ad M. A. Fiol, Maximally coected digraphs, Graph Theory,vol.13,o.6,pp.657 668,1989. [8] T.Soeoka,H.Nakada,M.Imase,adC.Peyrat, Sufficietcoditios for maximally coected dese graphs, Discrete Mathematics,vol.63,o.1,pp.53 66,1987. [9] P. Dakelma ad O. R. Oellerma, Bouds o the average coectivity of a graph, Discrete Applied Mathematics,vol.129, o. 2-3, pp. 305 318, 2003. [10] W.-S. Chiue ad B.-S. Shieh, O coectivity of the Cartesia productoftwographs, Applied Mathematics ad Computatio, vol. 102, o. 2-3, pp. 129 137, 1999. Propositio 16. Let r 3ad t 3be positive itegers. The 23, ifr=3, t=3; { 9 (i) κ av (P r P t )= 3 2 t, ifr=3, t 4; { 3 8 { r t, ifr 4, t 4. (ii) κ av (P r C t )= { 3, if r = 3, 4, t 3; { 4 4 { r, ifr 5, t 4. (iii) κ av (C r C t )=4. (21) Coflict of Iterests The author declares that there is ocoflict of iterests regardig the publicatio of this paper. Ackowledgmet The author wishes to thak Bo-Qig Dog for his helpful suggestios ad correctios. Refereces [1] K. S. Bagga, L. W. Beieke, R. E. Pippert, ad M. J. Lipma, A classificatio scheme for vulerability ad reliability parameters of graphs, Mathematical ad Computer Modellig, vol. 17, o. 11, pp. 13 16, 1993. [2] O. R. Oellerma, Coectivity ad edge-coectivity i graphs: a survey, Cogressus Numeratium, vol.116,pp.231 252, 1996. [3] M. A. Heig, Trees with equal average domiatio ad idepedet domiatio umbers, Ars Combiatoria, vol. 71, pp. 305 318, 2004. [4] L.W.Beieke,O.R.Oellerma,adR.E.Pippert, Theaverage coectivity of a graph, Discrete Mathematics,vol.252,o.1 3, pp.31 45,2002. [5] A. Hellwig ad L. Volkma, Maximally edge-coected ad vertex-coected graphs ad digraphs: a survey, Discrete Mathematics,vol.308,o.15,pp.3265 3296,2008. [6] Y.-C. Che, Super coectivity of k-regular itercoectio etworks, Applied Mathematics ad Computatio, vol.217,o. 21, pp. 8489 8494, 2011.

Advaces i Operatios Research Advaces i Decisio Scieces Applied Mathematics Algebra Probability ad Statistics The Scietific World Joural Iteratioal Differetial Equatios Submit your mauscripts at Iteratioal Advaces i Combiatorics Mathematical Physics Complex Aalysis Iteratioal Mathematics ad Mathematical Scieces Mathematical Problems i Egieerig Mathematics Discrete Mathematics Discrete Dyamics i Nature ad Society Fuctio Spaces Abstract ad Applied Aalysis Iteratioal Stochastic Aalysis Optimizatio

2024 © financedocbox.com Privacy Policy | Terms of Service | Feedback