Add to ORKGWe prove that a k-ary 2-cube $Q_k^2$ with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal)
AbstractIn this paper, we investigate the fault-tolerant edge-bipancyclicity of an n-dimensional sta...
Abstract—The augmented k-ary n-cube AQn,k is a recently proposed interconnection network that incorp...
AbstractA bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even len...
We prove that a k-ary 2-cube Qk2 with 3 faulty edges but where every vertex is incident with at leas...
AbstractA graph G is said to be f-fault p-pancyclic if after removing f faulty vertices and/or edges...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks f...
The k-ary n-cube, denoted by Qn k, is one of the most important interconnection networks for paralle...
Let F be a faulty set in an n-dimensional hypercube Q(n) such that in Q(n) - F each vertex is incide...
AbstractIt is well known that the k-ary n-cube has been one of the most efficient interconnection ne...
An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for eac...
AbstractIn this paper we study the existence of cycles of all lengths in the cube-connected cycles g...
[[abstract]]For two vertices X, Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shor...
[[abstract]]The (n, k)-star graphs are a generalized version of n-star graphs, which belong to the c...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
AbstractIn this paper, we investigate the fault-tolerant edge-bipancyclicity of an n-dimensional sta...
Abstract—The augmented k-ary n-cube AQn,k is a recently proposed interconnection network that incorp...
AbstractA bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even len...
We prove that a k-ary 2-cube Qk2 with 3 faulty edges but where every vertex is incident with at leas...
AbstractA graph G is said to be f-fault p-pancyclic if after removing f faulty vertices and/or edges...
The interconnection network considered in this paper is the k-ary n-cube that is an attractive varia...
It is well known that the k-ary n-cube has been one of the most efficient interconnection networks f...
The k-ary n-cube, denoted by Qn k, is one of the most important interconnection networks for paralle...
Let F be a faulty set in an n-dimensional hypercube Q(n) such that in Q(n) - F each vertex is incide...
AbstractIt is well known that the k-ary n-cube has been one of the most efficient interconnection ne...
An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for eac...
AbstractIn this paper we study the existence of cycles of all lengths in the cube-connected cycles g...
[[abstract]]For two vertices X, Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shor...
[[abstract]]The (n, k)-star graphs are a generalized version of n-star graphs, which belong to the c...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
AbstractIn this paper, we investigate the fault-tolerant edge-bipancyclicity of an n-dimensional sta...
Abstract—The augmented k-ary n-cube AQn,k is a recently proposed interconnection network that incorp...
AbstractA bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even len...