DOCSLIB.ORG

Edge Fault-Tolerance Analysis of Maximally Edge-Connected Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Edge Fault-Tolerance Analysis of Maximally Edge-Connected Graphs Journal of Computer and System Sciences 115 (2021) 64–72 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Edge fault-tolerance analysis of maximally edge-connected ✩ graphs and super edge-connected graphs ∗ Shuang Zhao a, Zongqing Chen b, Weihua Yang c, Jixiang Meng a, a College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China b School of Science, Tianjin Chengjian University, Tianjin 300384, China c Department of Mathematics, Taiyuan University of Techology, Taiyuan 030024, China a r t i c l e i n f o a b s t r a c t Article history: Edge fault-tolerance of interconnection network is of significant important to the design Received 8 October 2019 and maintenance of multiprocessor systems. A connected graph G is maximally edge- Received in revised form 20 May 2020 connected (maximally-λ for short) if its edge-connectivity attains its minimum degree. G is Accepted 8 July 2020 super edge-connected (super-λ for short) if every minimum edge-cut isolates one vertex. Available online 23 July 2020 The edge fault-tolerance of the maximally-λ (resp. super-λ) graph G with respect to the Keywords: maximally-λ (resp. super-λ) property, denoted by mλ(G) (resp. Sλ(G)), is the maximum − Edge fault-tolerance integer m for which G S is still maximally-λ (resp. super-λ) for any edge subset S Maximally edge-connected with |S| ≤ m. In this paper, we give upper and lower bounds on mλ(G). Furthermore, we Super edge-connected completely determine the exact values of mλ(G) and Sλ(G) for vertex transitive graphs. Vertex transitive graph © 2020 Elsevier Inc. All rights reserved. 1. Introduction It is well-known that a network can be modeled by a graph G = (V (G), E(G)), where the vertex set V (G) represents the node-set of the network and the edge set E(G) represents the link-set of the network. Then requirements in the design of the network correspond to graph measures. In [33], several measurements for building networks, such as diameter, hamiltonicity, connectivity and symmetry are discussed. Since link faults may happen when a network is put in use, apart from such network requirements, it is practically meaningful and important to consider faulty networks [17]. The problems of diameter and hamiltonicity have been solved on a variety of faulty networks, see [16–18,25,30,35]. Comparatively, there are few results about connectivity, concerning with the faulty networks. As a traditional measurement for reliability and fault-tolerance of the network, the edge-connectivity of a connected graph G, denoted by λ(G), is the minimum cardinality of a set of edges (named as edge-cut) of G, whose removal from G makes the remaining graph no longer connected. It is well-known that λ(G) ≤ δ(G), where δ(G) is the minimum degree of G. Hence, a graph G with λ(G) = δ(G) is said to be maximally edge-connected, maximally-λ for short. To design more reliable networks, besides the requirement of maximal edge-connectivity, it is also desirable that the number of minimum edge-cuts is as small as possible. For this purpose, Bauer et al. [3]defined the super edge-connected graphs. A connected graph G is called super edge-connected, or simply super-λ, if every minimum edge-cut isolates one vertex. A more refined measurement is the restricted edge-connectivity, proposed by Esfahanian and Hakimi [9]. The restricted edge-connectivity λ (G), is the minimum cardinality of a set of edges (named as restricted edge-cut) of G, if any, whose dele- ✩ The research is supported by NSFC (No. 11531011). * Corresponding author. E-mail address: [email protected] (J. Meng). https://doi.org/10.1016/j.jcss.2020.07.002 0022-0000/© 2020 Elsevier Inc. All rights reserved. S. Zhao et al. / Journal of Computer and System Sciences 115 (2021) 64–72 65 tion makes G not connected and the remaining graph contains no isolated vertices. A graph G is said to be λ -connected, if λ (G) exists. A λ -connected graph G is called super restricted edge-connected, or simply super-λ , if every minimum restricted edge-cut isolates an edge. Known results about λ(G) and λ (G) are presented in [6,12,13,20–24,27,28,32,34,35]. In [14], Hong, Meng and Zhang proposed a parameter, denoted by Sλ(G), to consider super edge-connectivity in graphs with faulty edges. The index Sλ(G) is the maximum integer m for which G − S is still super-λ for any edge subset S with |S| ≤ m. In [14], the authors gave upper and lower bounds on Sλ(G) and presented more refined bounds on Sλ(G) for some special classes of graphs. Motivated by these, a quite natural problem can be introduced as follows. For a graph G with some connectivity property P, how many faulty edges can be tolerated such that the remaining graph still has property P? We can define a parameter with respect to property P, denoted by mP (G), as the maximum integer m for which G − S still has property P for any edge subset S with |S| ≤ m. The parameter mP (G) can be used to evaluate the reliability and fault-tolerance more reasonably. If one seeks to destroy a network in such a way that the damaged network no longer has property P, then we have to destroy at least mP (G) + 1edges. Thus, the value of mP (G) will provide a beneficial reference for engineers when designing or selecting networks to build parallel systems. Wang and Lu [29]studied three families of super-λ networks with faulty edges. In [15], Hong and Xu investigated mP (G) when P denotes the property of super-λ , and determined the exact value of mP (G) for two families of networks. Wang et al. [31] considered super-λ Cartesian product graphs with faulty edges. In [8], Cheng and Hsieh gave upper and lower (k) bounds on mP (G), where P denotes the property of super-λ (see [8]for definition) for k ≥ 3. This paper is concerned with this parameter, denoted by mλ(G), when P denotes the property of maximally-λ. In [26], Sun, Zhao and Meng studied mλ(G) for two families of networks. The rest of this paper is organized as follows. In Section 2, we introduce some definitions and related results which are to be used in this paper. In Section 3, we present upper and lower bounds on mλ(G). In Section 4, we focus on giving values of mλ(G) under some conditions. In Section 5, we completely determine how many edges can be deleted such that the remaining graph is still super-λ for super-λ vertex transitive graphs. 2. Definitions and related results In this section, we introduce some definitions and related results which will be used in the following sections. For graph-theoretical terminologies and notations not given here, we follow [5,11]. = | | Let G (V (G), E(G)) be a graph. The order of G is the size of V (G) . We use NG (v) to denote the neighbor set of the vertex v ∈ V (G), and NG (A) = ( ∈ NG (v)) \ A for A ⊆ V (G). We write dA (v) =|NG (v) ∩ A|. For X, X ⊆ V (G), notations v A [X, X ]G and G[X] are used to denote the set of edges between X and X in G, and the subgraph of G induced by X, respectively. When the graph under consideration is obvious, we use ω(X) instead of [X, X], where X = V (G) \ X. A clique of G is a subset X of V (G) such that G[X] is complete. If, furthermore, |X| = k, then X is a k-clique. We use Kn, Cn and K1,n−1 to denote the complete graph, the cycle and the star of order n. In the design of network topology, highly symmetric graphs, for instance vertex transitive graphs or edge transitive graphs, are popular due to their desirable properties [2,19,33]. If for any two vertices u, v ∈ V (G), there is an automorphism φ ∈ Aut(G) such that φ(u) = v, then G is vertex transitive, where Aut(G) denotes the automorphism group of G. A vertex transitive graph is always regular. It is known that vertex transitive graphs are maximally-λ [22]. Circulant graphs are ≤ ≤ n examples of vertex transitive graphs. Let Zn be the ring of integers modulo n and 1 a1 < a2 <...<ak 2 be k integers. The circulant graph G(n; a1, a2, ..., ak) is a graph with vertex set Zn, and for any i ∈ Zn, i is adjacent to i ± a1, i ± a2, ..., i ± ak (mod n). And G(n; a1, a2, ..., ak) is connected if and only if gcd(n, a1, a2, ..., ak) = 1. G is edge transitive if for any two edges e, f ∈ E(G), there is an automorphism φ ∈ Aut(G) such that φ(e) = f . Since edge transitive graph G satisfies κ(G) = δ(G) [32], where κ(G) is the vertex-connectivity of G, combining with κ(G) ≤ λ(G) ≤ δ(G), we see that edge transitive graph is also maximally-λ. Now, we introduce the definition of the edge fault-tolerance of a maximally-λ graph G with respect to the maximally-λ property. Definition 2.1. A maximally-λ graph G is m-maximally edge-connected (m-maximally-λ for short) if G − S is still maximally-λ for any edge subset S ⊆ E(G) with |S| ≤ m.
Load more

Recommended publications
  • Interval Edge-Colorings of Graphs
    University of Central Florida STARS Electronic Theses and Dissertations, 2004-2019 2016 Interval Edge-Colorings of Graphs Austin Foster University of Central Florida Part of the Mathematics Commons Find similar works at: https://stars.library.ucf.edu/etd University of Central Florida Libraries http://library.ucf.edu This Masters Thesis (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Electronic Theses and Dissertations, 2004-2019 by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Foster, Austin, "Interval Edge-Colorings of Graphs" (2016). Electronic Theses and Dissertations, 2004-2019. 5133. https://stars.library.ucf.edu/etd/5133 INTERVAL EDGE-COLORINGS OF GRAPHS by AUSTIN JAMES FOSTER B.S. University of Central Florida, 2015 A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the Department of Mathematics in the College of Sciences at the University of Central Florida Orlando, Florida Summer Term 2016 Major Professor: Zixia Song ABSTRACT A proper edge-coloring of a graph G by positive integers is called an interval edge-coloring if the colors assigned to the edges incident to any vertex in G are consecutive (i.e., those colors form an interval of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, motivated by the problem of finding compact school timetables. In 1992, Hansen described another scenario using interval edge-colorings to schedule parent-teacher con- ferences so that every person’s conferences occur in consecutive slots.
    [Show full text]
  • Uniform Factorizations of Graphs
    Western Michigan University ScholarWorks at WMU Dissertations Graduate College 12-1979 Uniform Factorizations of Graphs David Burns Western Michigan University Follow this and additional works at: https://scholarworks.wmich.edu/dissertations Part of the Mathematics Commons Recommended Citation Burns, David, "Uniform Factorizations of Graphs" (1979). Dissertations. 2682. https://scholarworks.wmich.edu/dissertations/2682 This Dissertation-Open Access is brought to you for free and open access by the Graduate College at ScholarWorks at WMU. It has been accepted for inclusion in Dissertations by an authorized administrator of ScholarWorks at WMU. For more information, please contact [email protected]. UNIFORM FACTORIZATIONS OF GRAPHS by David Burns A Dissertation Submitted to the Faculty of The Graduate College in partial fulfillment of the Degree of Doctor of Philosophy Western Michigan University Kalamazoo, Michigan December 197 9 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. ACKNOWLEDGEMENT S I wish to thank Professor Shashichand Kapoor, my advisor, for his guidance and encouragement during the writing of this dissertation. I would also like to thank my other working partners Professor Phillip A. Ostrand of the University of California at Santa Barbara and Professor Seymour Schuster of Carleton College for their many contributions to this study. I am also grateful to Professors Yousef Alavi, Gary Chartrand, and Dionsysios Kountanis of Western Michigan University for their careful reading of the manuscript and to Margaret Johnson for her expert typing. David Burns Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. INFORMATION TO USERS This was produced from a copy of a document sent to us for microfilming.
    [Show full text]
  • A Characterization of the Doubled Grassmann Graphs, the Doubled Odd Graphs, and the Odd Graphs by Strongly Closed Subgraphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector European Journal of Combinatorics 24 (2003) 161–171 www.elsevier.com/locate/ejc A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs Akira Hiraki Division of Mathematical Sciences, Osaka Kyoiku University, 4-698-1 Asahigaoka, Kashiwara, Osaka 582-8582, Japan Received 27 November 2001; received in revised form 14 October 2002; accepted 3 December 2002 Abstract We characterize the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by the existence of sequences of strongly closed subgraphs. c 2003 Elsevier Science Ltd. All rights reserved. 1. Introduction Known distance-regular graphs often have many subgraphs with high regularity. For example the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs satisfy the following condition. For any given pair (u,v) of vertices there exists a strongly closed subgraph containing them whose diameter is the distance of u and v. In particular, any ‘non- trivial’ strongly closed subgraph is distance-biregular, and that is regular iff its diameter is odd. Our purpose in this paper is to prove that a distance-regular graph with this condition is either the doubled Grassmann graph, the doubled Odd graph, or the Odd graph. First we recall our notation and terminology. All graphs considered are undirected finite graphs without loops or multiple edges. Let Γ be a connected graph with usual distance ∂Γ . We identify Γ with the set of vertices.
    [Show full text]
  • Tilburg University Graphs Whose Normalized Laplacian Has Three
    Tilburg University Graphs whose normalized laplacian has three eigenvalues van Dam, E.R.; Omidi, G.R. Published in: Linear Algebra and its Applications Publication date: 2011 Document Version Peer reviewed version Link to publication in Tilburg University Research Portal Citation for published version (APA): van Dam, E. R., & Omidi, G. R. (2011). Graphs whose normalized laplacian has three eigenvalues. Linear Algebra and its Applications, 435(10), 2560-2569. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Download date: 29. sep. 2021 Graphs whose normalized Laplacian has three eigenvalues¤ E.R. van Dama G.R. Omidib;c;1 aTilburg University, Dept. Econometrics and Operations Research, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands bDept. Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran cSchool of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran edwin:vandam@uvt:nl romidi@cc:iut:ac:ir Abstract We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues.
    [Show full text]
  • Dissertation Maximal Curves, Zeta Functions, and Digital
    DISSERTATION MAXIMAL CURVES, ZETA FUNCTIONS, AND DIGITAL SIGNATURES Submitted by Beth Malmskog Department of Mathematics In partial fulfillment of the requirements For the Degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Spring 2011 Doctoral Committe: Advisor: Rachel Pries Jeffrey Achter Tim Penttila Jacob Roberts ABSTRACT MAXIMAL CURVES, ZETA FUNCTIONS, AND DIGITAL SIGNATURES Curves with as many points as possible over a finite field Fq under the Hasse- Weil bound are called maximal curves. Besides being interesting as extremal objects, maximal curves have applications in coding theory. A maximal curves may also have a great deal of symmetry, i.e. have an automorphism group which is large compared to the curve's genus. In Part 1, we study certain families of maximal curves and find a large subgroup of each curve's automorphism group. We also give an upper bound for the size of the automorphism group. In Part 2, we study the zeta functions of graphs. The Ihara zeta function of a graph was defined by Ihara in the 1960s. It was modeled on other zeta functions in its form, an infinite product over primes, and has some analogous properties, for example convergence to a rational function. The knowledge of the zeta function of a regular graph is equivalent to knowledge of the eigenvalues of its adjacency matrix. We calculate the Ihara zeta function for an infinite family of irregular graphs and consider how the same technique could be applied to other irregular families. We also discuss ramified coverings of graphs and a joint result with Michelle Manes on the divisibility properties of zeta functions for graphs in ramified covers.
    [Show full text]
  • Regular Or Distance- Biregular
    IOURNAL OF COMBINATORIAL THEORY, Series B 43. 14-24 (1987) Distance-Regularised Graphs Are Distance- Regular or Distance- Biregular CHRIS D. GODSIL Deparfment of Mathematics, Simon Fraser CJnil;ersity, Burnaby, British Columbia VSA 135, Canada AND JOHN SHAWE-TAYLOR Department of Statisfics and Cumputer Science, Royal Holloway College, Egham Hill, Egham, Surrey TW20 OEX, England Communicated bv Ihe Managing Editors Received June 7, 1985 One problem with the theory of distance-regular graphs is that it does not apply duectly to the graphs of generalised polygons. In this paper we overcome this dif- ficulty by introducing the class of distance-regularised graphs, a natural common generalisation. These graphs are shown to either be distance-regular or fall into a family of bipartite graphs called distance-biregular. This family includes the generalised polygons and other interesting graphs. Despite this increased generahty we are also able to extend much of the basic theory of distance-regular graphs to our wider class of graphs. c 1987 Academx Press, Inc. 1. INTRODUCTION, EXAMPLES AND DEFINITIONS A graph G is distance-regular if, for any integer k and vertices x and y, the number of vertices at distance k from x and adjacent to y only depends on d(x, y), the distance between x and y (note that such graphs must be regular). A generalised polygon or generalised n-gon is a bipartite graph of diameter n with vertices in the same colour class having the same degree and with pairs of vertices less than distance n apart joined by a unique shortest path.
    [Show full text]
  • Biregular Graphs with Three Eigenvalues Whose Switchings (With Respect to the Valency Partition) Also Have Three Distinct Eigenvalues
    BIREGULAR GRAPHS WITH THREE EIGENVALUES XI-MING CHENG, ALEXANDER L. GAVRILYUK♦, GARY R. W. GREAVES♣, AND JACK H. KOOLEN♠ Dedicated to Misha Klin on the occasion of his retirement. Abstract. We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure the- orems, valency constraints, and a classification of certain special families of such graphs. We also present a new example of a graph with three valencies and three eigenvalues of which there are currently only finitely many known examples. 1. Introduction In the late 1990s, as a generalisation of strongly regular graphs, attention was brought to the study of nonregular graphs whose adjacency matrices have pre- cisely three distinct eigenvalues. We continue this investigation focussing mainly on graphs having precisely two distinct valencies, so-called biregular graphs. Muzy- chuk and Klin [18] called such graphs ‘strongly biregular graphs’. An n-vertex graph with a vertex of valency n 1 is called a cone. Given a graph Γ, the cone over Γ is the graph formed by adjoining− a vertex adjacent to every vertex of Γ. Examples of families of strongly biregular graphs are complete bipartite graphs and cones over strongly regular graphs. Indeed, a complete bipartite graph 1 n+m−2 1 Kn,m (for n>m > 1) has spectrum [√nm] , [0] , [ √nm] . The following result due to Muzychuk and Klin offers{ a method for finding− strongly} biregular cones. Proposition 1.1 (See [18]). Let Γ be a (non-complete) strongly regular graph with n vertices, valency k, and smallest eigenvalue θ2.
    [Show full text]
  • Distance-Regular Graphs Arxiv:1410.6294V2 [Math.CO]
    Distance-regular graphs∗ Edwin R. van Dam Jack H. Koolen Department of Econometrics and O.R. School of Mathematical Sciences Tilburg University University of Science and Technology of China The Netherlands and [email protected] Wu Wen-Tsun Key Laboratory of Mathematics of CAS Hefei, Anhui, 230026, China [email protected] Hajime Tanaka Research Center for Pure and Applied Mathematics Graduate School of Information Sciences Tohoku University Sendai 980-8579, Japan [email protected] Mathematics Subject Classifications: 05E30, 05Cxx, 05Exx Abstract This is a survey of distance-regular graphs. We present an introduction to distance- regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph `BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written. Keywords: Distance-regular graph; survey; association scheme; P -polynomial; Q- polynomial; geometric arXiv:1410.6294v2 [math.CO] 15 Apr 2016 ∗This version is published in the Electronic Journal of Combinatorics (2016), #DS22. 1 Contents 1 Introduction6 2 An introduction to distance-regular graphs8 2.1 Definition . .8 2.2 A few examples . .9 2.2.1 The complete graph . .9 2.2.2 The polygons . .9 2.2.3 The Petersen graph and other Odd graphs . .9 2.3 Which graphs are determined by their intersection array? . .9 2.4 Some combinatorial conditions for the intersection array . 11 2.5 The spectrum of eigenvalues and multiplicities . 12 2.6 Association schemes . 15 2.7 The Q-polynomial property .
    [Show full text]
  • The Second Malta Conference in Graph Theory and Combinatorics 2017
    The Second Malta Conference in Graph Theory and Combinatorics 2017 2MCGTC-2017 in honour of the 75th birthday of Professor Stanley Fiorini 26{30 June 2017 ii Welcome Address Mer~ba! We are honoured that you chose to join us for The Second Malta Confer- ence in Graph Theory and Combinatorics. This conference is commemorating the 75th birthday of Professor Stanley Fiorini, who introduced graph theory and combinatorics at the University of Malta. Many of you may be asking when the previous Malta Conference was held? The First Malta Conference on Graphs and Combinatorics was held during the period 28 May { 2 June, 1990, at the Suncrest Hotel, also in Qawra, St Paul's Bay. It differed from a number of similar conferences held in the central Mediterranean region at that time in that it consisted of three types of lectures. L´aszl´oLov´aszand Carsten Thomassen delivered two instructional courses of five one-hour lectures each; the former was A survey of independent sets in graphs and the latter was on Embeddings of graphs. There were also four invited speakers, namely L.W. Beineke, N.L. Biggs, R. Graham and D.J.A. Welsh, each of whom gave a one-hour lecture. The third type of talks were the 20-minute contributed talks running in two parallel sessions and given by 39 speakers. Volume 124 (1994) of the journal Discrete Mathematics was a special edition dedicated to this conference; it was edited by Stanley Fiorini and Josef Lauri, and it consisted of 22 selected papers. Twenty-seven years later we are gathered here for the second such conference organ- ised in the Island of Malta.
    [Show full text]
  • Download Download
    Electronic Journal of Linear Algebra, ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 36, pp. 446-460, July 2020. A GENERAL METHOD TO OBTAIN THE SPECTRUM AND LOCAL SPECTRA OF A GRAPH FROM ITS REGULAR PARTITIONS∗ CRISTINA DALFO´ y AND MIQUEL ANGEL` FIOLz Abstract. It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also the local spectra, of a graph from the quotient matrices of some of its regular partitions, is proposed. Moreover, from such partitions, the C-local multiplicities of any class of vertices C is also determined, and some applications of these parameters in the characterization of completely regular codes and their inner distributions are described. As examples, it is shown how to find the eigenvalues and (local) multiplicities of walk-regular, distance-regular, and distance-biregular graphs. Key words. Adjacency matrix, Spectrum, Eigenvalues, Local multiplicities, Walk-regular graph, C-local spectrum, Completely regular code. AMS subject classifications. 05C50, 05E30. 1. Introduction. It is well known that the (adjacency) spectrum of a graph Γ does not determine, in general, its whole structure. However, many combinatorial properties of Γ can be derived from its spectrum. See, for example, the comprehensive textbooks of Biggs [1], Cvetkovi´c,Doob, and Sachs [6], Cvetkovi´c, Rowlinson, and Simi´c[7], and Brouwer and Haemers [3]. In particular, a persisting problem is to show whether or not a given graph is completely determined by its spectrum (see van Dam and Haemers [11]), which has led to the following conjecture.
    [Show full text]
  • Super Cyclically Edge Connected Half Vertex Transitive Graphs*
    Applied Mathematics, 2013, 4, 348-351 http://dx.doi.org/10.4236/am.2013.42053 Published Online February 2013 (http://www.scirp.org/journal/am) Super Cyclically Edge Connected Half Vertex * Transitive Graphs Haining Jiang, Jixiang Meng#, Yingzhi Tian College of Mathematics and System Sciences, Xinjiang University, Urumqi, China Email: [email protected], #[email protected], [email protected] Received October 21, 2012; revised December 26, 2012; accepted January 3, 2013 ABSTRACT Tian and Meng in [Y. Tian and J. Meng, c -Optimally half vertex transitive graphs with regularity k , Information Processing Letters 109 (2009) 683-686] shown that a connected half vertex transitive graph with regularity k and girth gG 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree G 4 and girth gG 6 . Keywords: Cyclic Edge-Connectivity; Cyclically Optimal; Super Cyclically Edge-Connected; Half Vertex Transitive Graph 1. Introduction cuts of G by following Plummer [4]. The concept of cyclic edge-connectivity as applied to planar graphs dates The traditional connectivity and edge-connectivity, are to the famous incorrect conjecture of Tait [5]. important measures for networks, which can correctly The cyclic edge-connectivity plays an important role reflect the fault tolerance of systems with few processors, in some classic fields of graph theory such as Hamil- but it always underestimates the resilience of large net- tonian graphs (Máčajová and Šoviera [6]), fullerence works. The discrepancy incurred is because events whose graphs (Kardoš and Šrekovski [7]), integer flow con- occurrence would disrupt a large network after a few jectures (Zhang [8]), n-extendable graphs (Holton et al.
    [Show full text]
  • Arxiv:1706.03298V2
    POLYNOMIAL RELATIONS BETWEEN MATRICES OF GRAPHS SAM SPIRO Abstract. We derive a correspondence between the eigenvalues of the adja- cency matrix A and the signless Laplacian matrix Q of a graph G when G is 2 (d1, d2)-biregular by using the relation A = (Q − d1I)(Q − d2I). This moti- vates asking when it is possible to have Xr = f(Y ) for f a polynomial, r > 0, and X, Y matrices associated to a graph G. It turns out that, essentially, this can only happen if G is either regular or biregular. Keywords: Combinatorics; Spectral Graph Theory; Biregular Graphs. 1. Introduction For G a simple graph, we let A denote the adjacency matrix of G and D the diagonal matrix of vertex degrees of G. We define the signless Laplacian matrix Q of G by Q = D + A, the Laplacian matrix L of G by L = D A, and when G has no isolated vertices, we define the normalized Laplacian− matrix of G 1/2 1/2 L by D− LD− . For more detailed information about these matrices see, for example, [2]. A graph G is said to be (d , d )-biregular (sometimes called semiregular) if V V 1 2 1 ∪ 2 is a partition of the vertices of G such that no two vertices of Vi are adjacent to one another (so G is bipartite), and for all v V , d = d . A graph is said to be ∈ i v i biregular if it is (d1, d2)-biregular for some d1, d2. When G is biregular it is possible to directly relate the eigenvalues of A and Q through the following formula of [3].
    [Show full text]