Generalized Connectivity of the Mycielskian Graph under g -Extra Restriction

: The g -extra connectivity is a very important index to evaluate the fault tolerance, reliability of interconnection networks. Let g be a non-negative integer, G be a connected graph with vertex set V and edge set E , a subset S ⊆ V is called a g -extra cut of G if the graph induced by the set G − S is disconnected and each component of G − S has at least g + 1 vertices. The g-extra connectivity of G , denoted as κ g ( G ) , is the cardinality of the minimum g -extra cut of G . Mycielski introduced a graph transformation to discover chromatic numbers of triangle-free graphs that can be arbitrarily large. This transformation converts a graph G into a new compound graph called µ ( G ) , also known as the Mycielskian graph of G . In this paper, we study the relationship on g -extra connectivity between the Mycielskian graph µ ( G ) and the graph G . In addition, we show that κ 3 ( µ ( G )) = 2 κ 1 ( G ) + 1 for κ 1 ( G ) ≤ min { 4, (cid:98) n 2 (cid:99)} , and prove the bounds of κ 2 g + 1 ( µ ( G )) for g ≥ 2.


Introduction
With the rise and swift progress of high-performance parallel computer technology, there is increasing focus on interconnection networks that exhibit strong performance.A well-designed topological structure offers significant benefits in enhancing reliability.When designing the network's topological structure, fault tolerance is a fundamental consideration.This means that the interconnection network should be able to operate effectively even when certain nodes and edges fail, ensuring that it retains specific network properties.Moreover, the topological structure of an interconnection network can be modeled as an undirected graph G = (V, E), where every vertex of V corresponds to a processor, and each edge of E corresponds to a communication link.Then many computer scientists and engineers use some parameters of graph theory to design and analyzing topological structures of interconnection networks, such as the connectivity.In order to design the topological structure of a network with good performance, the fault-tolerance must be considered.This means that the network should be able to function effectively even if certain nodes and edges fail, while still maintaining specific network properties.Additionally, the structure of an interconnection network can be represented as an undirected graph G = (V, E), where each vertex in V represents a processor, and each edge in E represents a communication link.Therefore, many computer scientists and engineers utilize various parameters from graph theory to design and analyze the topological structures of interconnection networks, including connectivity.
The connectivity is a crucial measure of fault-tolerance in an interconnection network.Generally, a higher connectivity indicates better fault-tolerance.Let F ⊆ V(G), F is called a cut set of G if the graph obtained by removing F is disconnected or trivial.The connectivity of a graph G, denoted by κ(G), is the minimum number of elements of all cut set of G.
To analyze disconnected graphs resulting from a vertex-cut in more detail, Harary [1] proposed investigating the conditional connectivities while imposing additional constraints on the vertex-cut F and/or the component of G − F. A notion concerning the number of vertices of each component associated with the disconnected graph G − F was first introduced by Fábrega and Fiol [2].Let g be a non-negative integer, G = (V, E) be a connected graph, a subset S ⊆ V is a g-extra cut of G if the graph induced by the set V − S is disconnected and each component of G − S has at least g + 1 vertices.The g-extra connectivity of G, denoted as κ g (G), is the cardinality of the minimum g-extra cut of G.When g = 0, we will write for short κ(G) instead of κ 0 (G).The exploration of the g-extra connectivity has achieved much progress, see [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20].
Many researchers are interested with chromatic number without small circles, see [21,22].To search for arbitrarily large chromatic numbers of triangle-free graphs, Mycielski [23] introduced a graph transformation that converts a graph G into a new compound graph µ(G).This transformed graph is known as the Mycielskian graph of G, as depicted below.For a graph G = (V, E), the graph µ(G) with We call the vertex x is the twin of the vertex x (and x is also the twin of x ).Morever, the set F (F ⊆ V ) is called the twin of F (and F is also the twin of F ) for some F ⊆ V.The vertex u is called as the root of µ(G).For instance, the Mycielskian graph of a path of order n is showed in Figure 1.
Recently, Chang et al. [24] have verified that κ(µ(G)) ≥ µ(G) + 1 if a graph G has no isolated vertices.In 2008, Raj and Balakrishnan [25] have studied the edge-connectivity λ(µ(G)) and the vertex-connectivity κ(µ(G)).In 2016, Guo and Liu [26] have shown that if G is a connected graph, then µ(G) is super-λ if and only if G K 2 , and µ(G) is super-κ if and only if δ(G) < 2κ(G).In addition, Guo et al. [27] derived the Mycielskian graph of a digraph in terms of the vertex(arc) connectivity.Recently, the relationship between the 3-connectivity of G has been established and generalized 3-connectivity of the Mycielskian graph µ(G) has been study by Li et al. [28], i.e., κ 3 (µ(G)) ≥ κ 3 (G) + 1.Moreover, they determined the generalized 3-connectivity of the Mycielskian graph of the tree T n , the complete graph K n and the complete bipartite graph K a,b .Now, the results on some graph parameters of the Mycielskian graphs have been obtained, see [29][30][31][32][33].
In this paper, we will discuss the relationship between the g-extra connectivity of µ(G) and G.In addition, we show that 2 }, and propose the bounds of κ 2g+1 (µ(G)) for (g ≥ 2).

Terminology and Notations
All graphs are simple, connected, finite and undirected in following section.For graph theoretical symbols and terminology not expounded here, we use for reference [34].For a graph G, let V and E represent the set of vertices and the set of edges of G. Let G and H be two graphs, H is called the subgraph of G subject to V(H) ⊆ V(G), E(H) ⊆ E(G).For any vertex subset X of the graph G, the graph G − X is the subgraph of G obtained by deleting all the vertices of X together with the edges incident with them from G. In case X = {v}, we simply write

Main Results
In this section, we determine the relationship between κ g (µ(G)) and κ g (G) for g ≥ 0.
For a graph G, in view of the fact κ 0 (G) = κ(G) and Lemma 1, the relationship between κ g (µ(G)) and κ g (G) is immediately obtained for g ≥ 0.
Lemma 2. Let F be a vertex cut of G, and G 1 , G 2 , . . ., G r (r ≥ 2) be all components of G − F.
(1) If there exists some G i (1 and F be the twin of G i and F, respectively).( 3) If there exists one vertex w such that w ∈ F and N G (w) ⊆ F, then µ(G) − (F ∪ {u}) is disconnected and w (w is the twin of w) is an isolated vertex.
Proof of Lemma 2. (1) As there exists some G i (1 ) In this situation, there exists one vertex w such that w ∈ F and N G (w) ⊆ F. By the construction of µ(G), w is the twin of w, and N µ(G) (w ) ⊆ (F ∪ {u}) (see Figure 2c).Then µ(G) − (F ∪ {u}) is disconnected and w is an isolated vertex.Theorem 2. Let G be a connected graph with n vertices such that κ 1 (G) ≤ min{4, n 2 }.Then Proof of Theorem 2. According to the definition of κ 1 (G), there exists a set ) is disconnected and each the rest of component has at least 4 vertices.Therefore, The following two cases will be discussed.
Case 1. u / ∈ S. Subcase 1.1 G − A is connected.Let M = G − A, where M and A are the twins of M and A, severally.We consider the situations as follow.
If (M ∪ N A (M)) ⊆ B , then µ(G) − S is disconnected (see Figure 3a).Thus, 2κ 1 (G) If (M ∪ N A (M)) B , then there exists at least one vertex w such that w ∈ (M ∪ N A (M)) and w / ∈ B .Since the root vertex u is adjacent to all vertices of V and w is connected to the connected component M, µ(G) − S is connected (see Figure 3b), a contradiction.Subcase 1.2 G − A is disconnected and each component of G − A has at least two vertices.
Clearly, |V ∩ S| = |A| ≥ κ 1 (G), and |B | ≤ κ 1 (G).By Lemma 2 (2), G i is connected to G i (G i is the twin of G i ), and G i is connected to the root vertex u, then µ(G) − S is connected, a contradiction.
Subcase 1.3 G − A is disconnected and at least one component is an isolated vertex.
We distinguish between the following two situations. If Next, we suppose that  5a), a contradiction.5b).If (A − N A (M)) B , then there exists at least one vertex w such that w ∈ (A − N A (M)) and w / ∈ B .Thus, µ(G) − S is disconnected and the smallest component is the vertex w (see Figure 5c), a contradiction.Subcase 2.2 G − A is disconnected and every component of G − A has at least two vertices.

If A N A (M). By the construction of µ(G), all vertices in (A
Clearly, By Lemma 2 (3), we have the following fact.Fact 1.All vertices of A are adjacent to some components of G − A.
If there exists one component, say G 1 , such that N A (G 1 ) = A, then G 1 is connected to all vertices of A (see Figure 6a).By Fact 1, all vertices of A are adjacent to some components of G − A, then µ(G) − S is connected, a contradiction. Otherwise, Then we have the following fact.
Fact 2. There exist some components By Fact 2, we decompose the set A into A 1 and A 2 , then some components of G − A are connected to A 1 , and the remaining components of G − A are connected to A 2 .By the construction of G, G − A 1 is disconnected and each component has at least two vertices, then If there exists one vertex w such that w ∈ X and w / ∈ B , then µ(G) − S is disconnected and w is an isolated vertex in µ(G) − S, which contradicts with the definition of κ 3 (µ(G)).Then we have the following fact.
By Fact 2, we decompose the set A into A 1 and A 2 , then some components of G − A are connected to A 1 and the remaining components of G − A are connected to A 2 .We consider the following four situations.
If each component G i (G i ⊆ X) and some components G j (G j ⊆ Y) are connected to A 1 , and the remaining components of Y are connected to A 2 (see Figure 7a).By the construction of G, we know that G − A 2 is disconnected and each component of G − A 2 has at least two vertices, then |A 2 | ≥ κ 1 (G).By the same reason, |A 1 | + |X| ≥ κ 1 (G).By Facts 1 and 3,  7b).By the same reason with the previous situation, then If some component G i (G i ⊆ X) are connected to A 1 such that the remaining components of X are connected to A 2 , and each component G j (G j ⊆ Y) in connected to A 2 (see Figure 7c).By the same reason with the previous situation.Thus, |S| ≥ κ 1 (G) + 5, which contradicts with |S| ≤ 2κ 1 (G) and κ 1 (G) ≤ 4.

If each component
If some components G i (G i ⊆ X) are connected to A 1 such that the remaining components of X are connected to A 2 , and some components G j (G j ⊆ Y) are connected to A 1 such that the remaining components of Y are connected to A 2 (see Figure 7d).Let If there exists one vertex w (w ∈ X) such that N A (w) ⊆ (A ∩ B ), then µ(G) − S is disconnected and w is an isolated vertex in µ(G) − S (see Figure 8a), which contradicts the definition of κ 3 (µ(G)).
Otherwise, we suppose that N A (G i ) (A ∩ B ) for any G i (G i ∈ X), it implies G i connected to A − (A ∩ B) for any G i (G i ∈ X).Next, we consider the following three situations.
for some G j (G j ∈ Y), and so every component of G − (A ∩ B) has at least two vertices in G (see Figure 8c).So, |A ∩ 8d).By the same reason with the Subcase 2.3.1 (the vertex set A − (A ∩ B ) in Subcase 2.3.2 is the same as the vertex set A in Subcase 2.3.1).Theorem 3. Let G be a connected graph with n vertices and g be a non-integer with g ≥ 2. Then Proof of Theorem 3. The upper bound is similar to that the upper bound of the Theorem 2.

Conclusions
In this paper, we investigate the relationship on the g-extra connectivity between the Mycielskian graph µ(G) and the original graph G.In addition, we show that

Figure 2 .
Figure 2.An illustration of the proof of Lemma 2.

Figure 3 .
Figure 3.An illustration of the proof of Subcase 1.1.

Figure 4 .
Figure 4.An illustration of the proof of Subcase 1.3.

Figure 5 .
Figure 5.An illustration of the proof of Subcase 2.1.

Figure 7 .
Figure 7.An illustration of the proof of Subcase 2.3.1.
By the same reason with the Subcase 2.2.1 (the vertex set A − (A ∩ B ) in Subcase 2.2.2 is the same as the vertex set A in Subcase 2.2.1).Subcase 2.3 G − A is disconnected and at least one component is an isolated vertex.Let X disconnected and each component has at least two vertices, then |A 1 | + |X 1 | ≥ κ 1 (G).By the same reason, |A 2 | + |X 2 | ≥ κ 1 (G).And by Facts 1 and 3,