216 research outputs found

    On the structure of graphs without short cycles

    Get PDF
    The objective of this thesis is to study cages, constructions and properties of such families of graphs. For this, the study of graphs without short cycles plays a fundamental role in order to develop some knowledge on their structure, so we can later deal with the problems on cages. Cages were introduced by Tutte in 1947. In 1963, Erdös and Sachs proved that (k, g) -cages exist for any given values of k and g. Since then, large amount of research in cages has been devoted to their construction. In this work we study structural properties such as the connectivity, diameter, and degree regularity of graphs without short cycles. In some sense, connectivity is a measure of the reliability of a network. Two graphs with the same edge-connectivity, may be considered to have different reliabilities, as a more refined index than the edge-connectivity, edge-superconnectivity is proposed together with some other parameters called restricted connectivities. By relaxing the conditions that are imposed for the graphs to be cages, we can achieve more refined connectivity properties on these families and also we have an approach to structural properties of the family of graphs with more restrictions (i.e., the cages). Our aim, by studying such structural properties of cages is to get a deeper insight into their structure so we can attack the problem of their construction. By way of example, we studied a condition on the diameter in relation to the girth pair of a graph, and as a corollary we obtained a result guaranteeing restricted connectivity of a special family of graphs arising from geometry, such as polarity graphs. Also, we obtained a result proving the edge superconnectivity of semiregular cages. Based on these studies it was possible to develop the study of cages. Therefore obtaining a relevant result with respect to the connectivity of cages, that is, cages are k/2-connected. And also arising from the previous work on girth pairs we obtained constructions for girth pair cages that proves a bound conjectured by Harary and Kovács, relating the order of girth pair cages with the one for cages. Concerning the degree and the diameter, there is the concept of a Moore graph, it was introduced by Hoffman and Singleton after Edward F. Moore, who posed the question of describing and classifying these graphs. As well as having the maximum possible number of vertices for a given combination of degree and diameter, Moore graphs have the minimum possible number of vertices for a regular graph with given degree and girth. That is, any Moore graph is a cage. The formula for the number of vertices in a Moore graph can be generalized to allow a definition of Moore graphs with even girth (bipartite Moore graphs) as well as odd girth, and again these graphs are cages. Thus, Moore graphs give a lower bound for the order of cages, but they are known to exist only for very specific values of k, therefore it is interesting to study how far a cage is from this bound, this value is called the excess of a cage. We studied the excess of graphs and give a contribution, in the sense of the work of Biggs and Ito, relating the bipartition of girth 6 cages with their orders. Entire families of cages can be obtained from finite geometries, for example, the graphs of incidence of projective planes of order q a prime power, are (q+1, 6)-cages. Also by using other incidence structures such as the generalized quadrangles or generalized hexagons, it can be obtained families of cages of girths 8 and 12. In this thesis, we present a construction of an entire family of girth 7 cages that arises from some combinatorial properties of the incidence graphs of generalized quadrangles of order (q,q)

    Superconnectivity of Networks Modeled by the Strong Product of Graphs

    Get PDF
    Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using graph terminology, we first give a lower bound for the vertex connectivity of the strong product of two networks and then we prove that the resulting structure is more reliable than its generators. Namely, sufficient conditions for a strong product of two networks to be maximally connected and superconnected are given.Ministerio de Economía y Competitividad MTM2014-60127-

    Extra Connectivity of Strong Product of Graphs

    Full text link
    The gg-extraextra connectivityconnectivity κg(G)\kappa_{g}(G) of a connected graph GG is the minimum cardinality of a set of vertices, if it exists, whose deletion makes GG disconnected and leaves each remaining component with more than gg vertices, where gg is a non-negative integer. The strongstrong productproduct G1⊠G2G_1 \boxtimes G_2 of graphs G1G_1 and G2G_2 is the graph with vertex set V(G1⊠G2)=V(G1)×V(G2)V(G_1 \boxtimes G_2)=V(G_1)\times V(G_2), where two distinct vertices (x1,y1),(x2,y2)∈V(G1)×V(G2)(x_{1}, y_{1}),(x_{2}, y_{2}) \in V(G_1)\times V(G_2) are adjacent in G1⊠G2G_1 \boxtimes G_2 if and only if x1=x2x_{1}=x_{2} and y1y2∈E(G2)y_{1} y_{2} \in E(G_2) or y1=y2y_{1}=y_{2} and x1x2∈E(G1)x_{1} x_{2} \in E(G_1) or x1x2∈E(G1)x_{1} x_{2} \in E(G_1) and y1y2∈E(G2)y_{1} y_{2} \in E(G_2). In this paper, we give the g (≤3)g\ (\leq 3)-extraextra connectivityconnectivity of G1⊠G2G_1\boxtimes G_2, where GiG_i is a maximally connected ki (≥2)k_i\ (\geq 2)-regular graph for i=1,2i=1,2. As a byproduct, we get g (≤3)g\ (\leq 3)-extraextra conditional fault-diagnosability of G1⊠G2G_1\boxtimes G_2 under PMCPMC model

    Minimally 3-restricted edge connected graphs

    Get PDF
    AbstractFor a connected graph G=(V,E), an edge set S⊂E is a 3-restricted edge cut if G−S is disconnected and every component of G−S has order at least three. The cardinality of a minimum 3-restricted edge cut of G is the 3-restricted edge connectivity of G, denoted by λ3(G). A graph G is called minimally 3-restricted edge connected if λ3(G−e)<λ3(G) for each edge e∈E. A graph G is λ3-optimal if λ3(G)=ξ3(G), where ξ3(G)=max{ω(U):U⊂V(G),G[U] is connected,|U|=3}, ω(U) is the number of edges between U and V∖U, and G[U] is the subgraph of G induced by vertex set U. We show in this paper that a minimally 3-restricted edge connected graph is always λ3-optimal except the 3-cube

    On the connectivity of p-diamond-free vertex transitive graphs

    Get PDF
    AbstractLet G be a graph of order n(G), minimum degree δ(G) and connectivity κ(G). We call the graph G maximally connected when κ(G)=δ(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex.For an integer p≥1, we define a p-diamond as the graph with p+2 vertices, where two adjacent vertices have exactly p common neighbors, and the graph contains no further edges. Usually, the 1-diamond is triangle and the 2-diamond is diamond. We call a graph p-diamond-free if it contains no p-diamond as a (not necessarily induced) subgraph. A graph is vertex transitive if its automorphism group acts transitively on its vertex set.In this paper, we give some sufficient conditions for vertex transitive graphs to be maximally connected. In addition, superconnected p-diamond-free (1≤p≤3) vertex transitive graphs are characterized
    • …
    corecore