Disjoint path covers of star graphs
Authors:
- Hongwei QiaoHQHongwei Qiao
- Jixiang MengJMJixiang Meng
- 10 October 2024
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 487
Abstract
No abstract availableKeywords
Funding Information
- Xinjiang Tianchi Doctoral Project
- National Natural Science Foundation of China
- Natural Science Foundation of Xinjiang
This publication has 32 references indexed in Scilit:
- Degree sequence conditions for a graph to be disjoint path coverableDiscrete Applied Mathematics, 2023
- Torus-like graphs and their paired many-to-many disjoint path coversDiscrete Applied Mathematics, 2021
- Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edgesThe Journal of Supercomputing, 2019
- Ore-type degree conditions for disjoint path covers in simple graphsDiscrete Mathematics, 2016
- Many-to-many two-disjoint path covers in cylindrical and toroidal gridsDiscrete Applied Mathematics, 2015
- Disjoint path covers in cubes of connected graphsDiscrete Mathematics, 2014
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition treesDiscrete Mathematics, 2012
- Hyper hamiltonian laceability on edge fault star graphInformation Sciences, 2004
- Hamiltonian-laceability of star graphsNetworks, 2000
- Conditional connectivityNetworks, 1983