Eminjan Sabir

Theor. Comput. Sci., 2025

2024

Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle.

[BibT_eX]

[DOI]

Weiyan Wu

Axioms, September, 2024

Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., March, 2024

The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

On spanning laceability of bipartite graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle.

[BibT_eX]

[DOI]

Weiyan Wu

Int. J. Parallel Emergent Distributed Syst., September, 2023

Reliability of augmented k-ary n-cubes under the extra connectivity condition.

[BibT_eX]

[DOI]

J. Supercomput., August, 2023

Degree sequence conditions for a graph to be disjoint path coverable.

[BibT_eX]

[DOI]

Discret. Appl. Math., June, 2023

Component connectivity of the data center network DCell.

[BibT_eX]

[DOI]

Xuemei Liu

Appl. Math. Comput., May, 2023

The edge fault-tolerant spanning laceability of the enhanced hypercube networks.

[BibT_eX]

[DOI]

J. Supercomput., April, 2023

The spanning cyclability of Cayley graphs generated by transposition trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2023

2022

The <i>g</i>-extra connectivity of folded crossed cubes.

[BibT_eX]

[DOI]

Huimei Guo

Aygul Mamut

J. Parallel Distributed Comput., 2022

Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2022

2021

Star structure connectivities of pancake graphs and burnt pancake graphs.

[BibT_eX]

[DOI]

Subinur Dilixiati

Int. J. Parallel Emergent Distributed Syst., 2021

Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

The Antistrong Property for Special Digraph Families.

[BibT_eX]

[DOI]

Lili Yuan

Graphs Comb., 2021

Structure Fault Tolerance of Recursive Interconnection Networks.

[BibT_eX]

[DOI]

Comput. J., 2021

Generalizations of the classics to spanning connectedness.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Sufficient conditions for graphs to be spanning connected.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2019

The extra connectivity of the enhanced hypercubes.

[BibT_eX]

[DOI]

Aygul Mamut

Elkin Vumar

Theor. Comput. Sci., 2019

Parallel routing in regular networks with faults.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

2018

Structure fault tolerance of hypercubes and folded hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2014

Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph.

[BibT_eX]

[DOI]